Gate-Based and Annealing-Based Quantum Algorithms for the Maximum K-Plex Problem

Xiaofan Li, Gao Cong, Rui Zhou

The $k$-plex model, which allows each vertex to miss connections with up to $k$ neighbors, serves as a relaxation of the clique. Its adaptability makes it more suitable for ana…