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
- 12759
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 6.9461197e-05
- Overall Rank
- 3,579 | 75.13%
- 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,147 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4060893e-05 |
| 7,934 |
On Density-based Local Community Search |
2024 |
PODS |
4.6089395e-05 |
| 9,409 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3399748e-05 |
| 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 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,477 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,500 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,526 |
Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,544 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1905499e-05 |
| 10,689 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1905499e-05 |
| 11,051 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,413 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1905499e-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 |
| 106 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048373761 |
| 280 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029092277 |
| 395 |
One Trillion Edges: Graph Processing at Facebook-Scale |
2015 |
VLDB |
0.00024440144 |
| 645 |
Densest Subgraph in Streaming and MapReduce |
2012 |
VLDB |
0.00018727714 |
| 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 |
| 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 |
| 6,720 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
4.9457362e-05 |
| 11,413 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1905499e-05 |
| 11,496 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
4.1905499e-05 |
Semantically Similar Papers