DBScholar

Back to papers

Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs

Summary: MCQC-TD is an exact top-down branch-and-bound method for finding the largest vertex-connectivity-based γ-quasi-clique, overcoming non-hereditary connectivity with structural pruning and guided branching. Initialization and decomposition improve scalability, yielding up to 10⁵× speedups. (summarized by gpt-6-luna on Oct 22 2026)

Paper ID
h25f63e2a3bcb0207
Venue
SIGMOD
Year
2027
Pagerank
4.9605343e-05
Overall Rank
10,395 | 30.33%
DOI
10.1145/3837110
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{liu_sigmod27,
        title = {{Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs}},
        author = {Liu, Yang and Huang, Hejiao and Yu, Kaiqiang and Liu, Shengxin and Gu, Zhaoquan},
        series = {{SIGMOD} '27},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3837110},
        url = {https://dl.acm.org/doi/10.1145/3837110},
        year = {2027}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers