Global Reinforcement of Social Networks: The Anchored Coreness Problem
Summary: Global reinforcement of social networks via anchored coreness: anchor a small vertex set to maximize total coreness gain. NP-hard; introduces pruning-based heuristic that reuses intermediate results, with experiments on real data demonstrating effectiveness and efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qingyuan Linghu
- 2. Fan Zhang
- 3. Xuemin Lin
- 4. Wenjie Zhang
- 5. Ying Zhang
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,323 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.2170169e-05 |
| 4,147 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD | 6.4060893e-05 |
| 4,737 | Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions | 2021 | SIGMOD | 5.9529218e-05 |
| 6,528 | Fast Algorithms for Core Maximization on Large Graphs | 2022 | VLDB | 5.0198578e-05 |
| 9,256 | Hindering Influence Diffusion of Community | 2022 | SIGMOD | 4.3648789e-05 |
| 10,246 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 106 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048373761 |
| 284 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029014359 |
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 734 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00017419528 |
| 1,150 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013647447 |
| 1,837 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010355705 |
| 1,848 | Effective Community Search over Large Spatial Graphs | 2017 | VLDB | 0.00010331574 |
| 3,608 | Skyline Community Search in Multi-valued Networks | 2018 | SIGMOD | 6.9241653e-05 |
| 4,727 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 5.9628488e-05 |
| 4,927 | Efficient Cohesive Subgraphs Detection in Parallel | 2014 | SIGMOD | 5.8181623e-05 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
Previous
Page 1 / 1
Next