Accelerating Maximal Clique Enumeration via Graph Reduction
Summary: RMCE: a reduction-based MCE framework that eliminates redundant recursive work using three reductions—global graph reduction, dynamic subgraph reduction, and a neighborhood-dominance maximality-check reduction. These shrink search space and verification cost, yielding large speedups over prior enumerators on 18 real graphs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wen Deng (Fudan University)
- 2. Weiguo Zheng (Fudan University)
- 3. Hong Cheng (Chinese University of Hong Kong)
BibTeX Citation
@article{deng_vldb24,
title = {{Accelerating Maximal Clique Enumeration via Graph Reduction}},
author = {Deng, Wen and Zheng, Weiguo and Cheng, Hong},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {10},
pages = {2419--2431},
doi = {10.14778/3675034.3675036},
url = {https://doi.org/10.14778/3675034.3675036},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,332 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 5.093636e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 2,112 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.1514258e-05 |
| 3,613 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 7.2572837e-05 |
| 4,579 | Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions | 2021 | SIGMOD | 6.6203846e-05 |
| 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 6.1751704e-05 |
| 7,764 | Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling | 2017 | SIGMOD | 5.5499989e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD |
| 2 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 3 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 4 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 5 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 6 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 7 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 8 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 9 | 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD |
| 10 | 10,332 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD |