Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach

Summary: Algorithm-system codesign for scalable maximal quasi-clique mining using a redesigned G-thinker with long-task prioritization and timeout-based load balancing. Adapts Quick to the framework, achieving up to 201× speedup on a 3.77M-vertex, 16.5M-edge graph. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12577
Venue: VLDB
Year: 2021
Pagerank: 5.6572863e-05
Overall Rank: 5,148 | 64.23%
DOI: 10.14778/3436905.3436916

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,709	Maximum k-Plex Computation: Theory and Practice	2024	SIGMOD	5.3622436e-05
7,109	Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach	2023	SIGMOD	4.8238188e-05
7,609	Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods	2025	VLDB	4.6921981e-05
9,404	Maximum k-Plex Search: An Alternated Reduction-and-Bound Method	2025	VLDB	4.3399748e-05
10,074	Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space	2026	SIGMOD	4.1905499e-05
10,654	Maximum k-Plex Finding: Choices of Pruning Techniques Matter!	2025	VLDB	4.1905499e-05

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
370	Online Search of Overlapping Communities	2013	SIGMOD	0.00025391823
829	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.00016137512
865	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015775653
888	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015549756
1,650	Efficient Enumeration of Maximal k-Plexes	2015	SIGMOD	0.00011002771
4,868	Application Driven Graph Partitioning	2020	SIGMOD	5.8595544e-05
6,206	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	5.1522897e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,541	Scalable Discovery of Best Clusters on Large Graphs	2010	VLDB	8.5710863e-05
6,005	GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra	2021	VLDB	5.2365238e-05
10,852	Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds	2025	VLDB	4.1905499e-05
9,552	Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs	2025	SIGMOD	4.3212967e-05
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05
773	Local Graph Sparsification for Scalable Clustering	2011	SIGMOD	0.00016788213
7,109	Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach	2023	SIGMOD	4.8238188e-05
10,689	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1905499e-05
13,264	Scalable Community Detection via Parallel Correlation Clustering	2021	VLDB	-
10,033	Scaling Up k-Clique Percolation Community Detection	2026	SIGMOD	4.1905499e-05