Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
Summary: Unifies DSP variants under a generalized density metric and introduces the c-core model to accelerate densest-subgraph search, up to 1,000× faster. Introduces DalkS (densest-at-least-k-subgraph) with a graph-decomposition algorithm achieving 0.8–0.99 density across constraints, outperforming prior 0.5-approx baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yichen Xu (Chinese University of Hong Kong)
- 2. Chenhao Ma (Chinese University of Hong Kong)
- 3. Yixiang Fang (Chinese University of Hong Kong)
- 4. Zhifeng Bao (Royal Melbourne Institute of Technology)
BibTeX Citation
@inproceedings{xu_sigmod23,
title = {{Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery}},
author = {Xu, Yichen and Ma, Chenhao and Fang, Yixiang and Bao, Zhifeng},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589314},
url = {https://dl.acm.org/doi/10.1145/3589314},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,519 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 5.2562724e-05 |
| 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 5.093636e-05 |
| 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 5.093636e-05 |
| 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 5.093636e-05 |
| 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 5.093636e-05 |
| 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 138 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00029823423 |
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 264 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00022980015 |
| 564 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016485347 |
| 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 |
| 4,015 | The Web as a graph | 2000 | PODS | 6.9542071e-05 |
| 4,903 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD | 6.4520708e-05 |
| 11,608 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,148 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 2 | 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 3 | 10,767 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 4 | 10,205 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 5 | 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 6 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 7 | 9,519 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 8 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 9 | 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 10 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |