Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs
Summary: Introduces integer R-subgraph density, yielding an AADS whose objective is within <1 of anchored densest-subgraph density. Re-orientation flow and shortest-path local algorithms enable scalable static search and efficient edge-update maintenance, including large anchor sets. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qi Zhang (University of Science and Technology Beijing)
- 2. Yalong Zhang (Beijing Institute of Technology)
- 3. Rong-Hua Li (Beijing Institute of Technology)
- 4. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@article{zhang_vldb25,
title = {{Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs}},
author = {Zhang, Qi and Zhang, Yalong and Li, Rong-Hua and Wang, Guoren},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {3},
pages = {623--636},
doi = {10.14778/3712221.3712230},
url = {https://doi.org/10.14778/3712221.3712230},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 2 | 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 3 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 4 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 5 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 6 | 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 7 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 8 | 10,256 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 9 | 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 10 | 4,358 | Anchored Densest Subgraph | 2022 | SIGMOD |