Efficient Maximum Clique Detection via Grover's Algorithm with Real-time Global Size Tracking

Wenmin Han, Shiqi Zheng, Peian Chen +1

The maximum clique problem (MCP) is to find the largest complete subgraph in an undirected graph, that is, the subgraph in which there are edges between every two different vertice…