A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
Raffaele Marino, Lorenzo Buffoni, Bogdán Zaválnij · Communications Physics · 2026
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. As such, this review is a continuation of the series of previous reviews from 1994, 1999 and 2014. The manuscript covers in a simple way classical algorithms and includes a review of recent developments in graph neural networks and quantum algorithms.