2 papers
cs.DB2025
Gate-Based and Annealing-Based Quantum Algorithms for the Maximum K-Plex Problem
Xiaofan Li, Gao Cong, Rui Zhou
The -plex model, which allows each vertex to miss connections with up to neighbors, serves as a relaxation of the clique. Its adaptability makes it more suitable for ana…
quant-ph2023
Quantum Algorithm for Maximum Biclique Problem
Xiaofan Li, Prasenjit Mitra, Rui Zhou +1
Identifying a biclique with the maximum number of edges bears considerable implications for numerous fields of application, such as detecting anomalies in E-commerce transactions,…