Integral Densest Subgraph Search on Directed Graphs
Summary: Proposes integral densest subgraph (IDS) for directed graphs, a near-DS model with a density floor. Develops (alpha,beta)-dense flow network for GetIDS (exact) with pruning; runs in O(p log|V| |E|^1.5), plus near-linear 2+epsilon MultiCore approximation. (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. Yalong Zhang (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Longlong Lin (Southwest University)
- 4. Qi Zhang (Beijing Institute of Technology)
- 5. Lu Qin (University of Technology Sydney)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{zhang_sigmod25,
title = {{Integral Densest Subgraph Search on Directed Graphs}},
author = {Zhang, Yalong and Li, Rong-Hua and Lin, Longlong and Zhang, Qi and Qin, Lu and Wang, Guoren},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725313},
url = {https://dl.acm.org/doi/10.1145/3725313},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 564 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016485347 |
| 1,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011232263 |
| 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.2907829e-05 |
| 3,148 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 7.707548e-05 |
| 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 7.1609645e-05 |
| 3,855 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 7.0712144e-05 |
| 4,903 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD | 6.4520708e-05 |
| 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB | 5.2755515e-05 |
| 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 2 | 4,903 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 3 | 9,553 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB |
| 4 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 5 | 9,689 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD |
| 6 | 11,608 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 7 | 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 8 | 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 9 | 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 10 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |