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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yang Liu (Harbin Engineering University)
- 2. Hejiao Huang (Harbin Engineering University)
- 3. Kaiqiang Yu (Nanjing University)
- 4. Shengxin Liu (Harbin Engineering University)
- 5. Zhaoquan Gu (Harbin Engineering University; Peng Cheng Laboratory)
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,034 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD |
| 2 | 10,868 | Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound | 2026 | VLDB |
| 3 | 11,595 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 4 | 5,007 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB |
| 5 | 8,913 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 6 | 5,486 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 7 | 3,591 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 8 | 4,568 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 9 | 5,569 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 10 | 7,017 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD |