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
- 2. Weiguo Zheng
- 3. Hong Cheng
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1905499e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1905499e-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 |
|---|---|---|---|---|
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 1,973 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.8834701e-05 |
| 4,147 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4060893e-05 |
| 4,737 | Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions | 2021 | SIGMOD | 5.9529218e-05 |
| 5,909 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2722596e-05 |
| 7,664 | Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling | 2017 | SIGMOD | 4.6805647e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,909 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2722596e-05 |
| 7,343 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 4.7511136e-05 |
| 6,811 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 4.9139947e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7811667e-05 |
| 3,496 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.0376611e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1905499e-05 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011002771 |
| 865 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015775653 |
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1905499e-05 |