- Article
The quasi-clique enumeration problem (degree-based quasi-cliques) is substantially more challenging than the classical clique problem because quasi-cliques do not satisfy the hereditary property, leading to exponential search spaces even in dense gra...