Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Summary: FastQC: a fast branch-and-bound method for maximal gamma-quasi-cliques with a co-designed pruning and branching strategy. Divide-and-conquer boosts performance; experiments on real graphs show up to two orders of magnitude speedup over prior methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kaiqiang Yu (Nanyang Technological University)
- 2. Cheng Long (Nanyang Technological University)
BibTeX Citation
@inproceedings{yu_sigmod23,
title = {{Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach}},
author = {Yu, Kaiqiang and Long, Cheng},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3617331},
url = {https://dl.acm.org/doi/10.1145/3617331},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 6.2061433e-05 |
| 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.2528121e-05 |
| 9,551 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.2528121e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
| 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5574945e-05 |
| 4,579 | Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions | 2021 | SIGMOD | 6.6203846e-05 |
| 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 6.3485708e-05 |
| 5,197 | Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach | 2021 | VLDB | 6.3229492e-05 |
| 7,233 | One Set to Cover All Maximal Cliques Approximately | 2022 | SIGMOD | 5.6658655e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD |
| 2 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 3 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 4 | 7,444 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB |
| 5 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 6 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 7 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 8 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 9 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 10 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |