Efficient k-Clique Count Estimation with Accuracy Guarantee
Summary: SR-kCCE pre-determines s, the number of uniformly sampled k-cliques required to meet a provable accuracy guarantee and to estimate sampling time. It stops refining the superset sample space when elapsed time ≈ estimated sampling time, balancing construction vs sampling and enabling efficient u.a.r. sampling. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of Sydney)
- 2. Rashmika Gamage (University of Sydney)
- 3. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{chang_vldb24,
title = {{Efficient k-Clique Count Estimation with Accuracy Guarantee}},
author = {Chang, Lijun and Gamage, Rashmika and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {3707--3719},
doi = {10.14778/3681954.3682032},
url = {https://doi.org/10.14778/3681954.3682032},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,914 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 5.6465623e-05 |
| 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2559789e-05 |
| 10,567 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 4.9793485e-05 |
| 10,789 | CREST: Approximate k-Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,209 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011534572 |
| 3,412 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 7.3251247e-05 |
| 3,610 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 7.1643588e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,224 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 2 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 3 | 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 4 | 1,616 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 5 | 1,209 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB |
| 6 | 10,537 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD |
| 7 | 3,412 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 8 | 11,045 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 9 | 7,807 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 10 | 10,567 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD |