Finding Locally Densest Subgraphs: A Convex Programming Approach
Summary: Introduces a convex-programming algorithm for locally densest subgraphs, uncovering multiple dense regions rather than only the global densest subgraph. Powerful pruning yields up to 10,000× speedups over prior LDS methods on billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chenhao Ma (University of Hong Kong)
- 2. Reynold Cheng (University of Hong Kong)
- 3. Laks V.S. Lakshmanan (University of British Columbia)
- 4. Xiaolin Han (University of Hong Kong)
BibTeX Citation
@article{ma_vldb22,
title = {{Finding Locally Densest Subgraphs: A Convex Programming Approach}},
author = {Ma, Chenhao and Cheng, Reynold and Lakshmanan, Laks V.S. and Han, Xiaolin},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {2719--2732},
doi = {10.14778/3551793.3551826},
url = {https://doi.org/10.14778/3551793.3551826},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,983 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD |
| 2 | 8,973 | An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 3 | 4,359 | Anchored Densest Subgraph | 2022 | SIGMOD |
| 4 | 11,329 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 5 | 10,454 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 6 | 7,814 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 7 | 3,791 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 8 | 2,044 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 9 | 4,924 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 10 | 10,818 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |