Back to papers
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
h7300664cfda86559
Venue
SIGMOD
Year
2010
Pagerank
0.00015208902
Overall Rank
645 | 95.67%
DOI
10.1145/1807167.1807217
Incoming Non-self Citations Over Time
BibTeX Citation
Copy BibTeX
@inproceedings{cheng_sigmod10,
title = {{Finding Maximal Cliques in Massive Networks by H*-graph}},
author = {Cheng, James and Ke, Yiping and Fu, Ada Wai-Chee and Yu, Jeffrey Xu and Zhu, Linhong},
series = {{SIGMOD} '10},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1807167.1807217},
url = {https://dl.acm.org/doi/10.1145/1807167.1807217},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 34 of 34 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
100
Truss Decomposition in Massive Networks
2012
VLDB
0.0003396253
184
Querying K-Truss Community in Large and Dynamic Graphs
2014
SIGMOD
0.00026097449
283
Online Search of Overlapping Communities
2013
SIGMOD
0.00022225677
600
Massive Graph Triangulation
2013
SIGMOD
0.00015733864
1,007
Influential Community Search in Large Networks
2015
VLDB
0.00012550629
1,508
Finding the Maximum Clique in Massive Graphs
2017
VLDB
0.00010445309
1,563
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph
2013
SIGMOD
0.00010219537
1,616
Efficient Enumeration of Maximal k-Plexes
2015
SIGMOD
0.00010061947
2,088
Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms
2016
SIGMOD
9.064678e-05
2,148
Maximum Co-located Community Search in Large Scale Social Networks
2018
VLDB
8.9552955e-05
2,540
Efficient Structural Graph Clustering: An Index-Based Approach
2018
VLDB
8.3235433e-05
2,606
K-Reach: Who is in Your Small World
2012
VLDB
8.2264537e-05
2,869
Hierarchical Core Maintenance on Large Dynamic Graphs
2021
VLDB
7.9197812e-05
3,109
Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees
2014
VLDB
7.6384672e-05
3,318
Skyline Community Search in Multi-valued Networks
2018
SIGMOD
7.4289128e-05
3,329
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
2015
SIGMOD
7.4158814e-05
3,376
Mining Bursting Core in Large Temporal Graphs
2022
VLDB
7.3556068e-05
3,936
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach
2012
SIGMOD
6.9140006e-05
4,424
Global Reinforcement of Social Networks: The Anchored Coreness Problem
2020
SIGMOD
6.6029248e-05
4,983
Accelerating Maximal Clique Enumeration via Graph Reduction
2024
VLDB
6.3261608e-05
5,104
Relational Approach for Shortest Path Discovery over Large Graphs
2012
VLDB
6.2703153e-05
5,329
K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks
2010
SIGMOD
6.1772055e-05
5,647
Repairing Vertex Labels under Neighborhood Constraints
2014
VLDB
6.0505094e-05
5,664
Efficiently Computing k-Edge Connected Components via Graph Decomposition
2013
SIGMOD
6.0444315e-05
5,721
Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs
2021
VLDB
6.0157099e-05
6,214
I/O Efficient ECC Graph Decomposition via Graph Reduction
2016
VLDB
5.8459668e-05
6,916
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
2025
VLDB
5.6438893e-05
7,374
One Set to Cover All Maximal Cliques Approximately
2022
SIGMOD
5.5381377e-05
7,640
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
2017
SIGMOD
5.4766381e-05
8,185
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
2024
VLDB
5.3801229e-05
9,812
I/O Efficient Label-Constrained Reachability Queries in Large Graphs
2024
VLDB
5.1233734e-05
10,807
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound
2026
VLDB
4.9769913e-05
11,224
Most Similar Biclique Search at Scale
2025
VLDB
4.9769913e-05
11,577
FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition
2024
VLDB
4.9769913e-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
1
10,818
Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer
2026
VLDB
2
8,893
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
2026
SIGMOD
3
1,648
Distance-generalized Core Decomposition
2019
SIGMOD
4
6,962
Towards Maximum Independent Sets on Massive Graphs
2015
VLDB
5
10,788
Aggregating maximal cliques in real-world graphs
2026
VLDB
6
1,616
Efficient Enumeration of Maximal k-Plexes
2015
SIGMOD
7
10,548
The Power of Core Clique Removal for Exact Clique Enumeration
2026
SIGMOD
8
8,185
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
2024
VLDB
9
4,983
Accelerating Maximal Clique Enumeration via Graph Reduction
2024
VLDB
10
1,508
Finding the Maximum Clique in Massive Graphs
2017
VLDB