Anchored Densest Subgraph
Summary: ADS outputs a supergraph of A maximizing R-subgraph density, favoring nodes near R and not over-popular. A local ADS algorithm scales with R, delivering significant speedups over the global method and outperforming prior local detectors in locality, density, and query efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yizhou Dai (University of Auckland)
- 2. Miao Qiao (University of Auckland)
- 3. Lijun Chang (University of Sydney)
BibTeX Citation
@inproceedings{dai_sigmod22,
title = {{Anchored Densest Subgraph}},
author = {Dai, Yizhou and Qiao, Miao and Chang, Lijun},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517890},
url = {https://dl.acm.org/doi/10.1145/3514221.3517890},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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 |
| 273 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022671795 |
| 564 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016485347 |
| 804 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.0001389717 |
| 1,069 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00012323497 |
| 1,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011232263 |
| 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.2907829e-05 |
| 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 7.1609645e-05 |
| 5,002 | Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures | 2017 | VLDB | 6.4066378e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,608 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 2 | 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 3 | 3,148 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 4 | 10,807 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 5 | 10,767 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 6 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 7 | 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 8 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 9 | 9,553 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB |
| 10 | 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |