Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs
This paper proposes MCQC-TD, a specialized exact branch-and-bound framework for the MCQC query, which adopts a top-down search strategy and exploits a novel structural characterization of γ-CQCs to enable effective pruning and guided branching, and substantially reduces the theoretical worst-case complexity compared to...