A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
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.
Authors
- Bogdán Zaválnij (ORCID: https://orcid.org/0000-0003-3060-0296)
- Raffaele Marino (ORCID: https://orcid.org/0000-0002-2311-4380)
- Lorenzo Buffoni (ORCID: https://orcid.org/0000-0002-8191-3375)
Institutions
- HUN-REN Alfréd Rényi Institute of Mathematics (HU)
- University of Florence (IT)
Publication Details
- Journal
- Communications Physics
- Published
- 2026-07-16
- DOI
- https://doi.org/10.1038/s42005-026-02606-7
- Primary Topic
- Complexity and Algorithms in Graphs
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- European Commission