The Power of Core Clique Removal for Exact Clique Enumeration
Summary: Core Clique Removal (CCR) strips a large core clique, yielding a sparser residual graph. Exact clique enumeration on the original graph reduces to the residual, enabling CCRMCE (maximal) and CCRKCE (k-clique) with major speedups on real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xiaowei Ye
- 2. Rong-Hua Li
- 3. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065491112 |
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 1,973 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.8913631e-05 |
| 4,270 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 6.3067205e-05 |
| 5,022 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 5.7536318e-05 |
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 6,532 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 5.0245678e-05 |
| 7,320 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 4.7629325e-05 |
| 9,239 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB | 4.3690661e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,406 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 4.3441378e-05 |
| 847 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015993322 |
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 10,033 | Scaling Up k-Clique Percolation Community Detection | 2026 | SIGMOD | 4.1945683e-05 |
| 5,022 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 5.7536318e-05 |
| 686 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00018178029 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1945683e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7867286e-05 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011013428 |
| 7,320 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 4.7629325e-05 |