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
- 2. Rong-Hua Li
- 3. Longlong Lin
- 4. Qi Zhang
- 5. Lu Qin
- 6. Guoren Wang
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 |
|---|---|---|---|---|
| 645 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00018727714 |
| 1,570 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011311977 |
| 2,913 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9229304e-05 |
| 3,579 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 6.9461197e-05 |
| 4,341 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 6.268429e-05 |
| 5,274 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD | 5.5919087e-05 |
| 5,302 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 5.5746393e-05 |
| 9,246 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB | 4.3648789e-05 |
| 11,051 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next