A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
Summary: k-clique densest subgraph via Frank-Wolfe reformulation that replaces expensive k-clique enumeration with counting. Efficient approximation using state-of-the-art counting plus optimizations; up to 10^7× faster than prior methods at same guarantee. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
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)
- 4. Chenhao Ma (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{zhou_sigmod24,
title = {{A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery}},
author = {Zhou, Yingli and Guo, Qingshuo and Fang, Yixiang and Ma, Chenhao},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654922},
url = {https://dl.acm.org/doi/10.1145/3654922},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,617 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.8212982e-05 |
| 9,866 | Finding Logic Bugs in Graph-processing Systems via Graph-cutting | 2025 | SIGMOD | 5.2043672e-05 |
| 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 5.093636e-05 |
| 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 5.093636e-05 |
| 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 5.093636e-05 |
| 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 5.093636e-05 |
| 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 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 | 4,903 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 2 | 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 3 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 4 | 8,822 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD |
| 5 | 1,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB |
| 6 | 10,205 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 7 | 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 8 | 3,613 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 9 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 10 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |