A Local Search Approach to Efficient (k, p)-Core Maintenance
Summary: Dynamic maintenance of (k, p)-cores in graphs via a Local search from the changed edge endpoints, avoiding global peeling. Proves core-change conditions, yields optimal [p*-, p*+] ⊆ [p-, p+] and shows Local is two orders of magnitude faster than Global. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Chenghan Zhang
- 2. Yuanyuan Zhu
- 3. Lijun Chang
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 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 999 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014726563 |
| 1,530 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00011495611 |
| 2,846 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.0234377e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 4,394 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.224902e-05 |
| 4,728 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 5.968586e-05 |
| 8,169 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 4.5698941e-05 |
Previous
Page 1 / 1
Next