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
- 2. Miao Qiao
- 3. Lijun Chang
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,145 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4122551e-05 |
| 7,986 | On Density-based Local Community Search | 2024 | PODS | 4.613363e-05 |
| 9,403 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 4.3441378e-05 |
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 10,072 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 4.1945683e-05 |
| 10,535 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 4.1945683e-05 |
| 10,582 | A Flexible Framework for Query-oriented Interactive Community Search | 2025 | VLDB | 4.1945683e-05 |
| 10,681 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.1945683e-05 |
| 10,865 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065491112 |
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 370 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00025415479 |
| 644 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00018748988 |
| 1,013 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.00014645542 |
| 1,530 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00011495611 |
| 1,570 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011322927 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 4,344 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 6.2744553e-05 |
| 5,177 | Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures | 2017 | VLDB | 5.6439245e-05 |
Previous
Page 1 / 1
Next