Efficient Algorithms for Densest Subgraph Discovery
Summary: Reduces densest-subgraph discovery to strategically identifying k-cores, enabling exact and approximation algorithms with guarantees. Generalizes across edge-, clique-, and pattern-based densities, achieving up to 10,000× speedups over prior methods. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yixiang Fang (Guangdong University of Technology; University of New South Wales; Zhejiang Lab)
- 2. Kaiqiang Yu (University of Hong Kong)
- 3. Reynold Cheng (University of Hong Kong)
- 4. Laks V.S. Lakshmanan (University of British Columbia)
- 5. Xuemin Lin (University of New South Wales; Zhejiang Lab)
BibTeX Citation
@article{fang_vldb19,
title = {{Efficient Algorithms for Densest Subgraph Discovery}},
author = {Fang, Yixiang and Yu, Kaiqiang and Cheng, Reynold and Lakshmanan, Laks V.S. and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {11},
pages = {1719--1732},
doi = {10.14778/3342263.3342645},
url = {https://doi.org/10.14778/3342263.3342645},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 40 of 40 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 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 | 10,879 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 2 | 10,636 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 3 | 10,499 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 4 | 9,004 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD |
| 5 | 11,966 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 6 | 7,832 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 7 | 10,520 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 8 | 3,778 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 9 | 11,284 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 10 | 11,383 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |