Back to papers
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
Summary: Introduces the [x, y]-core, a dense-subgraph primitive for directed graphs, enabling DDS discovery with guarantees. Exact and approximation DDS algorithms on the core yield up to six orders of magnitude speedups on real data, addressing scalability for fraud detection and community mining.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5912
- Venue
- SIGMOD
- Year
- 2020
- Pagerank
- 6.2744553e-05
- Overall Rank
- 4,344 | 69.79%
- DOI
-
10.1145/3318464.3389697
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 2,286 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0982591e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 3,575 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9528126e-05 |
| 4,145 |
Scaling Up k-Clique Densest Subgraph Detection |
2023 |
SIGMOD |
6.4122551e-05 |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 5,355 |
Anchored Densest Subgraph |
2022 |
SIGMOD |
5.5517073e-05 |
| 5,513 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
5.4641695e-05 |
| 5,792 |
Querying in the Age of Graph Databases and Knowledge Graphs |
2021 |
SIGMOD |
5.325937e-05 |
| 6,513 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.0321577e-05 |
| 6,719 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
4.9504873e-05 |
| 7,341 |
Scalable Time-Range k-Core Query on Temporal Graphs |
2023 |
VLDB |
4.7576413e-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,474 |
Community Detection in Heterogeneous Information Networks Without Materialization |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,490 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,517 |
Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum |
2025 |
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 |
| 10,865 |
Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs |
2025 |
VLDB |
4.1945683e-05 |
| 11,044 |
Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation |
2024 |
VLDB |
4.1945683e-05 |
| 11,303 |
Density Personalized Group Query |
2023 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 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,681 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
4.1945683e-05 |
| 11,048 |
Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 10,490 |
Integral Densest Subgraph Search on Directed Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 10,072 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
4.1945683e-05 |