Back to papers
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)
- Paper ID
- 13978
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,689 | 25.72%
- DOI
-
10.14778/3748191.3748210
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 57 |
Discovering Large Dense Subgraphs in Massive Graphs |
2005 |
VLDB |
0.00065421423 |
| 280 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029092277 |
| 645 |
Densest Subgraph in Streaming and MapReduce |
2012 |
VLDB |
0.00018727714 |
| 734 |
Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis |
2013 |
VLDB |
0.00017419528 |
| 888 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015549756 |
| 1,029 |
Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification |
2012 |
VLDB |
0.00014568714 |
| 1,570 |
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs |
2020 |
VLDB |
0.00011311977 |
| 2,913 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9229304e-05 |
| 3,406 |
Piggybacking on Social Networks |
2013 |
VLDB |
7.1298853e-05 |
| 3,579 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9461197e-05 |
| 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 |
| 4,341 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.268429e-05 |
| 5,274 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5919087e-05 |
| 5,365 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
5.5463723e-05 |
| 5,620 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
5.4066581e-05 |
| 6,185 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1618114e-05 |
| 6,446 |
On A Quest for Combating Filter Bubbles and Misinformation |
2022 |
SIGMOD |
5.0535002e-05 |
| 6,509 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.0273291e-05 |
| 7,343 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7511136e-05 |
| 7,934 |
On Density-based Local Community Search |
2024 |
PODS |
4.6089395e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4401156e-05 |
| 9,409 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3399748e-05 |
| 9,652 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3067693e-05 |
| 10,544 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1905499e-05 |
| 11,413 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1905499e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,557 |
An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3212967e-05 |
| 9,652 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3067693e-05 |
| 1,570 |
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs |
2020 |
VLDB |
0.00011311977 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1905499e-05 |
| 4,341 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.268429e-05 |
| 11,413 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1905499e-05 |
| 4,147 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4060893e-05 |
| 10,544 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1905499e-05 |
| 2,913 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9229304e-05 |
| 9,409 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3399748e-05 |