Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach
Summary: Algorithm-system codesign for scalable maximal γ-quasi-clique mining: adapts Quick to a redesigned G-thinker engine that prioritizes long tasks and uses timeouts to decompose them, mitigating unpredictable load imbalance and achieving 201× speedup. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Guimu Guo (University of Alabama)
- 2. Da Yan (University of Alabama)
- 3. M. Tamer Özsu (University of Waterloo)
- 4. Zhe Jiang (University of Alabama)
- 5. Jalal Khalil (University of Alabama)
BibTeX Citation
@article{guo_vldb21,
title = {{Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach}},
author = {Guo, Guimu and Yan, Da and Özsu, M. Tamer and Jiang, Zhe and Khalil, Jalal},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {4},
pages = {573--585},
doi = {10.14778/3436905.3436916},
url = {https://doi.org/10.14778/3436905.3436916},
year = {2021}
}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 |
| 7,032 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD | 5.7222954e-05 |
| 7,601 | Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods | 2025 | VLDB | 5.5866563e-05 |
| 9,551 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.2528121e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
| 10,898 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 273 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022671795 |
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 886 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD | 0.0001340645 |
| 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00010539891 |
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 4,365 | Application Driven Graph Partitioning | 2020 | SIGMOD | 6.740899e-05 |
| 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.1809407e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,961 | GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra | 2021 | VLDB |
| 2 | 11,072 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB |
| 3 | 8,477 | Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs | 2025 | SIGMOD |
| 4 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 5 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 6 | 7,032 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD |
| 7 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 8 | 13,454 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB |
| 9 | 10,205 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 10 | 10,328 | Scaling Up k-Clique Percolation Community Detection | 2026 | SIGMOD |