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
- 13977
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,681 | 25.70%
- 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.00065491112 |
| 279 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029113513 |
| 644 |
Densest Subgraph in Streaming and MapReduce |
2012 |
VLDB |
0.00018748988 |
| 738 |
Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis |
2013 |
VLDB |
0.00017435236 |
| 891 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015564292 |
| 1,029 |
Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification |
2012 |
VLDB |
0.00014582849 |
| 1,570 |
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs |
2020 |
VLDB |
0.00011322927 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 3,403 |
Piggybacking on Social Networks |
2013 |
VLDB |
7.136763e-05 |
| 3,575 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9528126e-05 |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 4,270 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.3067205e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 5,355 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
5.5517073e-05 |
| 5,610 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
5.4118541e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 6,450 |
On A Quest for Combating Filter Bubbles and Misinformation |
2022 |
SIGMOD |
5.0583557e-05 |
| 6,513 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.0321577e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
| 7,986 |
On Density-based Local Community Search |
2024 |
PODS |
4.613363e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4443756e-05 |
| 9,403 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3441378e-05 |
| 9,651 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3109001e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-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.3254416e-05 |
| 9,651 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3109001e-05 |
| 1,570 |
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs |
2020 |
VLDB |
0.00011322927 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1945683e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 9,403 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3441378e-05 |