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
- 2. Chenhao Ma
- 3. Yixiang Fang
- 4. Zhifeng Bao
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,409 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 4.3399748e-05 |
| 10,072 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 4.1905499e-05 |
| 10,544 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 4.1905499e-05 |
| 10,689 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.1905499e-05 |
| 11,051 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065421423 |
| 284 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029014359 |
| 327 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00027312381 |
| 645 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00018727714 |
| 3,579 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 6.9461197e-05 |
| 3,696 | The Web as a graph | 2000 | PODS | 6.829057e-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 |
| 11,413 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next