Finding Maximal Cliques in Massive Networks by H*-graph

Summary: Introduces H*-graph, a core-plus-neighborhood model to bound memory for maximal clique enumeration. Proposes ExtMCE, first external-memory MCE algorithm using H*-graph, with correctness and completeness guarantees and scalable performance on RAM-limited data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4266
Venue: SIGMOD
Year: 2010
Pagerank: 0.0001816451
Overall Rank: 682 | 95.27%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 33 of 33 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
106	Truss Decomposition in Massive Networks	2012	VLDB	0.00048373761
284	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029014359
370	Online Search of Overlapping Communities	2013	SIGMOD	0.00025391823
588	Massive Graph Triangulation	2013	SIGMOD	0.00019588834
865	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015775653
1,256	Influential Community Search in Large Networks	2015	VLDB	0.00013009097
1,650	Efficient Enumeration of Maximal k-Plexes	2015	SIGMOD	0.00011002771
1,879	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010227906
2,440	Efficient Structural Graph Clustering: An Index-Based Approach	2018	VLDB	8.8166939e-05
2,608	Maximum Co-located Community Search in Large Scale Social Networks	2018	VLDB	8.4587487e-05
2,685	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	8.314724e-05
2,762	K-Reach: Who is in Your Small World	2012	VLDB	8.1614818e-05
2,916	Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees	2014	VLDB	7.9062736e-05
3,274	Global Reinforcement of Social Networks: The Anchored Coreness Problem	2020	SIGMOD	7.2886717e-05
3,323	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.2170169e-05
3,608	Skyline Community Search in Multi-valued Networks	2018	SIGMOD	6.9241653e-05
3,857	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6924202e-05
4,070	Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach	2012	SIGMOD	6.4739921e-05
4,209	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	6.3511029e-05
5,221	Relational Approach for Shortest Path Discovery over Large Graphs	2012	VLDB	5.6180753e-05
5,360	K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks	2010	SIGMOD	5.5477372e-05
5,881	Repairing Vertex Labels under Neighborhood Constraints	2014	VLDB	5.2872198e-05
6,145	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB	5.1853422e-05
6,206	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	5.1522897e-05
6,599	One Set to Cover All Maximal Cliques Approximately	2022	SIGMOD	4.9929128e-05
7,318	Accelerating Maximal Clique Enumeration via Graph Reduction	2024	VLDB	4.7583643e-05
7,343	I/O Efficient ECC Graph Decomposition via Graph Reduction	2016	VLDB	4.7511136e-05
7,664	Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling	2017	SIGMOD	4.6805647e-05
8,809	Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks	2024	VLDB	4.4401156e-05
9,402	Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance	2025	VLDB	4.3399748e-05
9,485	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3300131e-05
10,539	Most Similar Biclique Search at Scale	2025	VLDB	4.1905499e-05
11,031	FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition	2024	VLDB	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,541	Scalable Discovery of Best Clusters on Large Graphs	2010	VLDB	8.5710863e-05
4,984	Efficient Maximum k-Defective Clique Computation with Improved Time Complexity	2023	SIGMOD	5.7811667e-05
10,074	Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space	2026	SIGMOD	4.1905499e-05
1,837	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010355705
6,877	Towards Maximum Independent Sets on Massive Graphs	2015	VLDB	4.8945769e-05
1,650	Efficient Enumeration of Maximal k-Plexes	2015	SIGMOD	0.00011002771
10,037	The Power of Core Clique Removal for Exact Clique Enumeration	2026	SIGMOD	4.1905499e-05
8,809	Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks	2024	VLDB	4.4401156e-05
7,318	Accelerating Maximal Clique Enumeration via Graph Reduction	2024	VLDB	4.7583643e-05
865	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015775653