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 (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{ye_sigmod26,
title = {{The Power of Core Clique Removal for Exact Clique Enumeration}},
author = {Ye, Xiaowei and Li, Rong-Hua and Wang, Guoren},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3749187},
url = {https://dl.acm.org/doi/10.1145/3749187},
year = {2026}
}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 |
|---|---|---|---|---|
| 102 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034255289 |
| 138 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00029823423 |
| 2,112 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.1514258e-05 |
| 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 6.9688824e-05 |
| 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 6.3533812e-05 |
| 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 6.2418958e-05 |
| 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 6.1751704e-05 |
| 7,444 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 5.6166432e-05 |
| 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB | 5.2755515e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,558 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB |
| 2 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 3 | 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD |
| 4 | 10,328 | Scaling Up k-Clique Percolation Community Detection | 2026 | SIGMOD |
| 5 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 6 | 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD |
| 7 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 8 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 9 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 10 | 7,444 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB |