Database Paper Browser

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
4265
Venue
SIGMOD
Year
2010
Pagerank
0.00018178029
Overall Rank
686 | 95.23%
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
108 Truss Decomposition in Massive Networks 2012 VLDB 0.00048300163
283 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00029041257
370 Online Search of Overlapping Communities 2013 SIGMOD 0.00025415479
589 Massive Graph Triangulation 2013 SIGMOD 0.00019576567
847 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015993322
1,257 Influential Community Search in Large Networks 2015 VLDB 0.00013020648
1,650 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00011013428
1,880 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.00010226347
2,436 Efficient Structural Graph Clustering: An Index-Based Approach 2018 VLDB 8.8252104e-05
2,603 Maximum Co-located Community Search in Large Scale Social Networks 2018 VLDB 8.4666465e-05
2,684 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 8.3136866e-05
2,756 K-Reach: Who is in Your Small World 2012 VLDB 8.1682536e-05
2,927 Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees 2014 VLDB 7.8823626e-05
3,273 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 7.2956944e-05
3,321 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 7.223972e-05
3,603 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 6.9306814e-05
3,854 Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity 2015 SIGMOD 6.6988744e-05
4,067 Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach 2012 SIGMOD 6.4795399e-05
4,208 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 6.357214e-05
5,215 Relational Approach for Shortest Path Discovery over Large Graphs 2012 VLDB 5.6228603e-05
5,351 K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks 2010 SIGMOD 5.5531181e-05
5,852 Repairing Vertex Labels under Neighborhood Constraints 2014 VLDB 5.3007132e-05
6,141 Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs 2021 VLDB 5.1903263e-05
6,207 Efficiently Computing k-Edge Connected Components via Graph Decomposition 2013 SIGMOD 5.1572428e-05
6,598 One Set to Cover All Maximal Cliques Approximately 2022 SIGMOD 4.9977108e-05
7,320 Accelerating Maximal Clique Enumeration via Graph Reduction 2024 VLDB 4.7629325e-05
7,346 I/O Efficient ECC Graph Decomposition via Graph Reduction 2016 VLDB 4.7556749e-05
7,673 Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling 2017 SIGMOD 4.6826056e-05
8,809 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 4.4443756e-05
9,396 Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance 2025 VLDB 4.3441378e-05
9,483 I/O Efficient Label-Constrained Reachability Queries in Large Graphs 2024 VLDB 4.3341665e-05
10,530 Most Similar Biclique Search at Scale 2025 VLDB 4.1945683e-05
11,028 FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition 2024 VLDB 4.1945683e-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

Overall Rank Paper Year Venue Pagerank
2,542 Scalable Discovery of Best Clusters on Large Graphs 2010 VLDB 8.5794502e-05
4,984 Efficient Maximum k-Defective Clique Computation with Improved Time Complexity 2023 SIGMOD 5.7867286e-05
10,074 Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space 2026 SIGMOD 4.1945683e-05
1,836 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010365753
6,873 Towards Maximum Independent Sets on Massive Graphs 2015 VLDB 4.8989748e-05
1,650 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00011013428
10,037 The Power of Core Clique Removal for Exact Clique Enumeration 2026 SIGMOD 4.1945683e-05
8,809 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 4.4443756e-05
7,320 Accelerating Maximal Clique Enumeration via Graph Reduction 2024 VLDB 4.7629325e-05
847 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015993322