A Pointer Network Based Deep Learning Algorithm for Maximum Clique Problem

The Maximum Clique Problem (MCP) is a classic combinatorial optimization problem in graph theory. Its deterministic algorithms include back tracking, branch and bound methods, etc. With the increase of the dimension of the maximum clique problem, the solution time increases greatly until it cannot b... View More