Back to papers
Finding Locally Densest Subgraphs: A Convex Programming Approach
Summary: Defines locally densest subgraph (LDS): densest in local neighborhoods to reveal multiple dense regions beyond the global DS. Convex-programming-based algorithm with pruning; up to 10^4× faster than the state of the art on seven real large graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12758
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 6.9528126e-05
- Overall Rank
- 3,575 | 75.14%
- DOI
-
10.14778/3551793.3551826
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 7,986 |
On Density-based Local Community Search |
2024 |
PODS |
4.613363e-05 |
| 9,403 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3441378e-05 |
| 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 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,490 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,517 |
Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 10,681 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1945683e-05 |
| 11,048 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 108 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048300163 |
| 279 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029113513 |
| 396 |
One Trillion Edges: Graph Processing at Facebook-Scale |
2015 |
VLDB |
0.00024424102 |
| 644 |
Densest Subgraph in Streaming and MapReduce |
2012 |
VLDB |
0.00018748988 |
| 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 |
| 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 |
| 6,719 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
4.9504873e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
| 11,492 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
4.1945683e-05 |
Semantically Similar Papers