Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques
Summary: Survey/tutorial on densest subgraph discovery (DSD) for large graphs: applications, challenges, and techniques. Taxonomic review of ~50 DSD works from SIGMOD, VLDB, TODS, WWW; groups solutions, analyzes models, and outlines future data-management research directions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yixiang Fang
- 2. Wensheng Luo
- 3. Chenhao Ma
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,575 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 6.9528126e-05 |
| 6,513 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0321577e-05 |
| 9,403 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 4.3441378e-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,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 |
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