Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach

Kaiqiang Yu, Cheng Long

Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis. One notable cohesive structure is $\gamma$-quasi-clique (QC), where each vertex connects at least…