Marino, Raffaele and Buffoni, Lorenzo and Zaválnij, Bogdán (2026) A Short Review on the Maximum Clique Problem Algorithms with Classical, AI and Quantum Methods. COMMUNICATIONS PHYSICS, 9. no.-239. ISSN 2399-3650
|
Text
s42005-026-02606-7.pdf - Published Version Available under License Creative Commons Attribution. Download (1MB) | Preview |
Official URL: https://doi.org/10.1038/s42005-026-02606-7
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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA76.527 Network technologies / Internetworking / hálózati technológiák, hálózatosodás Q Science / természettudomány > QC Physics / fizika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 20 Nov 2026 15:14 |
| Last Modified: | 20 Nov 2026 15:14 |
| URI: | https://real.mtak.hu/id/eprint/250435 |
Actions (login required)
![]() |
View Item |




