CREST: Approximate k-Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space
Summary: CREST accelerates Monte Carlo k-clique counting by refining star-based sample spaces, exactly eliminating countable subgraphs, and introducing an accuracy-aware stopping rule. It achieves up to 100× speedups while preserving target accuracy on real-world networks. (summarized by gpt-5.6-luna on Aug 17 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yehyun Nam (Seoul National University)
- 2. Jihoon Jang (Seoul National University)
- 3. Kunsoo Park (Seoul National University)
- 4. Joong Chae Na (Sejong University)
- 5. Hyunjoon Kim (Hanyang University)
BibTeX Citation
@article{nam_vldb26,
title = {{CREST: Approximate k-Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space}},
author = {Nam, Yehyun and Jang, Jihoon and Park, Kunsoo and Na, Joong Chae and Kim, Hyunjoon},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {9},
pages = {2331--2343},
doi = {10.14778/3819518.3819554},
url = {https://doi.org/10.14778/3819518.3819554},
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 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 |
|---|---|---|---|---|
| 130 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.0003029792 |
| 1,198 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011541919 |
| 3,000 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 7.7498183e-05 |
| 3,597 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 7.1598365e-05 |
| 6,813 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 5.6596752e-05 |
| 7,832 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 5.4289543e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,591 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 2 | 3,597 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 3 | 10,609 | Scaling Up k-Clique Percolation Community Detection | 2026 | SIGMOD |
| 4 | 11,383 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 5 | 8,913 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 6 | 10,613 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD |
| 7 | 7,832 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 8 | 1,198 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB |
| 9 | 3,396 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 10 | 6,813 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB |