Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques
Summary: Tutorial surveying densest-subgraph discovery across community detection, indexing, motifs, and fraud detection, emphasizing application-driven challenges and links to flow/matching. It taxonomizes and compares ~50 database/data-mining solutions, then identifies open research directions. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yixiang Fang (Chinese University of Hong Kong)
- 2. Wensheng Luo (Chinese University of Hong Kong)
- 3. Chenhao Ma (University of Hong Kong)
BibTeX Citation
@article{fang_vldb22,
title = {{Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques}},
author = {Fang, Yixiang and Luo, Wensheng and Ma, Chenhao},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {12},
pages = {3766--3769},
doi = {10.14778/3554821.3554895},
url = {https://doi.org/10.14778/3554821.3554895},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,064 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 7.6898682e-05 |
| 6,651 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.7203229e-05 |
| 7,807 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 5.4495451e-05 |
| 8,974 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD | 5.2454233e-05 |
| 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 4.9793485e-05 |
| 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 4.9793485e-05 |
| 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB | 4.9793485e-05 |
| 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 4.9793485e-05 |
| 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.9793485e-05 |
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 | 7,807 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 2 | 4,923 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 3 | 10,421 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 4 | 10,256 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 5 | 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 6 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 7 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 8 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 9 | 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 10 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |