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

Autor:	Marino, Raffaele, Buffoni, Lorenzo, Zavalnij, Bogdan
Rok vydání:	2024
Předmět:	Computer Science - Artificial Intelligence Condensed Matter - Disordered Systems and Neural Networks Computer Science - Data Structures and Algorithms Computer Science - Machine Learning Mathematics - Optimization and Control Quantum Physics
Druh dokumentu:	Working Paper
Popis:	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. Comment: 24 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2403.09742 Zobrazit plný text záznamu View this record from Arxiv