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.

翻译：本手稿对最大团问题进行了全面综述，该计算问题旨在寻找图中所有顶点两两相邻的子集。文章以简明方式阐述了求解该问题的经典算法，并综述了图神经网络与量子算法的最新进展。最后，本综述提供了用于测试经典算法、新型学习算法及量子算法的基准测试方法。