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 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,066 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 6.2786224e-05 |
| 7,017 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD | 5.6041834e-05 |
| 7,729 | Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods | 2025 | VLDB | 5.4511876e-05 |
| 8,913 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2361195e-05 |
| 9,714 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.124163e-05 |
| 10,395 | Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs | 2027 | SIGMOD | 4.9605343e-05 |
| 11,359 | Maximum k-Plex Finding: Choices of Pruning Techniques Matter! | 2025 | VLDB | 4.9605343e-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 |
|---|---|---|---|---|
| 274 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022499515 |
| 771 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014081924 |
| 914 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD | 0.00013081245 |
| 1,495 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.0001046246 |
| 1,591 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010107236 |
| 4,445 | Application Driven Graph Partitioning | 2020 | SIGMOD | 6.5804872e-05 |
| 4,567 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.5173666e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,126 | GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra | 2021 | VLDB |
| 2 | 8,920 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB |
| 3 | 8,087 | Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs | 2025 | SIGMOD |
| 4 | 1,995 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 5 | 1,179 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 6 | 7,017 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD |
| 7 | 11,383 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 8 | 13,813 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB |
| 9 | 10,499 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 10 | 10,609 | Scaling Up k-Clique Percolation Community Detection | 2026 | SIGMOD |