Efficient and Scalable Directed Densest Subgraph Discovery
Summary: Novel provable graph-reduction that isolates the directed densest subgraph into a much smaller instance, enabling drastic pruning. A gradient-projection approximation with faster convergence and an exact algorithm built on it, yielding up to 100× speedups. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yingli Zhou (Chinese University of Hong Kong)
- 2. Luocheng Liang (Chinese University of Hong Kong)
- 3. Yixiang Fang (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{zhou_sigmod26,
title = {{Efficient and Scalable Directed Densest Subgraph Discovery}},
author = {Zhou, Yingli and Liang, Luocheng and Fang, Yixiang},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769785},
url = {https://dl.acm.org/doi/10.1145/3769785},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 5.093636e-05 |
| 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 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 | 4,554 | Anchored Densest Subgraph | 2022 | SIGMOD |
| 2 | 9,696 | An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 3 | 10,767 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 4 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 5 | 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 6 | 11,608 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 7 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 8 | 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 9 | 4,903 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 10 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |