Review details classical, AI, and quantum algorithms for maximum clique problem

This manuscript offers a comprehensive review of the Maximum Clique Problem, detailing algorithms that utilize classical, AI, and quantum methods. It continues a series of reviews dating back to 1994, with the latest version incorporating recent advancements in graph neural networks and quantum algorithms. The paper aims to cover these developments in a straightforward manner. AI

IMPACT Provides a consolidated overview of AI techniques applied to a specific computational problem, useful for researchers in graph theory and AI.

RANK_REASON The item is a research paper published on arXiv detailing algorithms. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• arXiv
• graph neural networks
• Raffaele Marino

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →