DBScholar

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.00015219469
Overall Rank
643 | 95.70%
DOI
10.1145/1807167.1807217

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@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
96 Truss Decomposition in Massive Networks 2012 VLDB 0.00034261728
182 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026383593
274 Online Search of Overlapping Communities 2013 SIGMOD 0.00022499515
599 Massive Graph Triangulation 2013 SIGMOD 0.00015700433
970 Influential Community Search in Large Networks 2015 VLDB 0.00012749284
1,495 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.0001046246
1,564 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.00010186448
1,591 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00010107236
2,072 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 9.0668141e-05
2,110 Maximum Co-located Community Search in Large Scale Social Networks 2018 VLDB 9.0222862e-05
2,470 Efficient Structural Graph Clustering: An Index-Based Approach 2018 VLDB 8.4015437e-05
2,617 K-Reach: Who is in Your Small World 2012 VLDB 8.2001569e-05
2,873 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 7.9005874e-05
3,101 Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees 2014 VLDB 7.6310428e-05
3,145 Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity 2015 SIGMOD 7.5828479e-05
3,221 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 7.5060153e-05
3,387 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 7.3346183e-05
3,933 Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach 2012 SIGMOD 6.9003202e-05
4,180 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 6.7474268e-05
4,567 Efficiently Computing k-Edge Connected Components via Graph Decomposition 2013 SIGMOD 6.5173666e-05
5,007 Accelerating Maximal Clique Enumeration via Graph Reduction 2024 VLDB 6.3052426e-05
5,115 Relational Approach for Shortest Path Discovery over Large Graphs 2012 VLDB 6.2559695e-05
5,345 K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks 2010 SIGMOD 6.1567883e-05
5,659 Repairing Vertex Labels under Neighborhood Constraints 2014 VLDB 6.0309201e-05
5,725 Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs 2021 VLDB 5.9991587e-05
6,226 I/O Efficient ECC Graph Decomposition via Graph Reduction 2016 VLDB 5.8266364e-05
6,933 Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance 2025 VLDB 5.6252271e-05
7,390 One Set to Cover All Maximal Cliques Approximately 2022 SIGMOD 5.5209526e-05
7,649 Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling 2017 SIGMOD 5.4598986e-05
8,187 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.3652509e-05
9,846 I/O Efficient Label-Constrained Reachability Queries in Large Graphs 2024 VLDB 5.1064323e-05
10,868 Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound 2026 VLDB 4.9605343e-05
11,280 Most Similar Biclique Search at Scale 2025 VLDB 4.9605343e-05
11,626 FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition 2024 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

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
Previous Page 1 / 1 Next

Semantically Similar Papers