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 11 of 11 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 |
|---|---|---|---|---|
| 131 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00030242586 |
| 184 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026100147 |
| 284 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022208562 |
| 561 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016396211 |
| 830 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.00013605481 |
| 1,092 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00012072382 |
| 1,209 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011534572 |
| 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.1416822e-05 |
| 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 7.0191274e-05 |
| 5,098 | Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures | 2017 | VLDB | 6.2741304e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 2 | 3,064 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 3 | 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 4 | 10,256 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 5 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 6 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 7 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 8 | 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 9 | 9,731 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB |
| 10 | 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |