A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
Abstract
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.
Fields of Study & Subjects
Quantum Computing Algorithms and Architecture
Publication details
- Journal / source
- Communications Physics
- Publisher
- Springer Science and Business Media LLC
- Volume
- 9
- Issue
- 1
- Publication date
- 16 July 2026
- Language
- EN