Back to papers
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)
- Paper ID
- 6885
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.3441378e-05
- Overall Rank
- 9,403 | 34.59%
- DOI
-
10.1145/3654922
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
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.
| 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 |
| 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,039 |
Local Algorithms for Hierarchical Dense Subgraph Discovery |
2019 |
VLDB |
9.7061003e-05 |
| 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,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 |
| 6,141 |
Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs |
2021 |
VLDB |
5.1903263e-05 |
| 9,651 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3109001e-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 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1945683e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-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,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 10,681 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1945683e-05 |