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 (Hunan University)
- 2. Xu Zhou (Hunan University)
- 3. Yan Ding (Hunan University)
- 4. Qing Liu (Zhejiang University)
- 5. Haoxian Xu (Hunan University)
- 6. Kenli Li (Hunan University)
BibTeX Citation
@article{huang_vldb26,
title = {{Anchored Maximum Communities over Large Directed Graphs}},
author = {Huang, Yang and Zhou, Xu and Ding, Yan and Liu, Qing and Xu, Haoxian and Li, Kenli},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {6},
pages = {1345--1357},
doi = {10.14778/3797919.3797939},
url = {https://doi.org/10.14778/3797919.3797939},
year = {2026}
}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 |
|---|---|---|---|---|
| 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.0865974e-05 |
| 3,855 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 7.0712144e-05 |
| 4,331 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 6.7561061e-05 |
| 4,485 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 6.6715036e-05 |
| 5,697 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 6.1174514e-05 |
| 6,465 | Fast Algorithms for Core Maximization on Large Graphs | 2022 | VLDB | 5.871325e-05 |
| 6,617 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.8212982e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 2 | 5,977 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB |
| 3 | 1,328 | Truss-based Community Search over Large Directed Graphs | 2020 | SIGMOD |
| 4 | 4,903 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 5 | 4,554 | Anchored Densest Subgraph | 2022 | SIGMOD |
| 6 | 3,395 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB |
| 7 | 10,226 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 8 | 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB |
| 9 | 6,465 | Fast Algorithms for Core Maximization on Large Graphs | 2022 | VLDB |
| 10 | 4,331 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD |