Anchored Maximum Communities over Large Directed Graphs
Summary: First anchored (k,l) -core maximization for directed graphs, modeling engagement on asymmetric social networks by selecting b seed vertices to maximize the directed core. NP-hard; FAD combines greedy scoring with pruning/candidate reduction and upper-bound termination, yielding >1000x speedup. (summarized by gpt-5.4-mini on Apr 12 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yang Huang
- 2. Xu Zhou
- 3. Yan Ding
- 4. Qing Liu
- 5. Haoxian Xu
- 6. Kenli Li
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,273 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 7.2956944e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 4,728 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 5.968586e-05 |
| 5,298 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 5.5799987e-05 |
| 6,141 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.1903263e-05 |
| 6,513 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0321577e-05 |
| 6,530 | Fast Algorithms for Core Maximization on Large Graphs | 2022 | VLDB | 5.0246792e-05 |
Previous
Page 1 / 1
Next