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
- 2. Rashmika Gamage
- 3. Jeffrey Xu Yu
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,402 | Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance | 2025 | VLDB | 4.3399748e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1905499e-05 |
| 10,078 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 4.1905499e-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,570 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011311977 |
| 4,147 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4060893e-05 |
| 4,266 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 6.3006582e-05 |
Previous
Page 1 / 1
Next