A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms

arXiv:2403.09742v1 Announce Type: cross
Abstract: This manuscript provides a comprehensive review of the Maximum Clique Problem, a computational problem that involves finding subsets of vertices in a graph that are all pairwise adjacent to each other. The manuscript covers in a simple way classical algorithms for solving the problem and includes a review of recent developments in graph neural networks and quantum algorithms. The review concludes with benchmarks for testing classical as well as new learning, and quantum algorithms.

abstract algorithms arxiv computational cond-mat.dis-nn cs.ai cs.ds cs.lg graph graph neural networks math.oc networks neural networks novel quant-ph quantum review subsets type