Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory
Summary: Provably sound graph-reduction that localizes the k-clique densest subgraph into a tiny subgraph, tackling high-degeneracy real-world graphs. Combines this reduction with fast k-clique counting to give an approximation with formal guarantees that is up to 10^4× faster and much more memory-efficient in practice. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yingli Zhou (Chinese University of Hong Kong)
- 2. Qingshuo Guo (Chinese University of Hong Kong)
- 3. Yixiang Fang (Chinese University of Hong Kong)
BibTeX Citation
@article{zhou_vldb25,
title = {{Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory}},
author = {Zhou, Yingli and Guo, Qingshuo and Fang, Yixiang},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {10},
pages = {3490--3503},
doi = {10.14778/3748191.3748210},
url = {https://doi.org/10.14778/3748191.3748210},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 4.9793485e-05 |
| 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 4.9793485e-05 |
| 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 26 of 26 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 2 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 3 | 11,916 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 4 | 3,412 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 5 | 10,421 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 6 | 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 7 | 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 8 | 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 9 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 10 | 7,807 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |