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 |
|---|---|---|---|---|
| 202 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00025608916 |
| 713 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014806877 |
| 812 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00013910201 |
| 1,128 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00012139459 |
| 2,240 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.9487473e-05 |
| 2,807 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.158882e-05 |
| 3,962 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 7.0625443e-05 |
| 4,421 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 6.7748547e-05 |
| 8,018 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 5.5638558e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,159 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 5.1725247e-05 |
| 10,134 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 5.1725247e-05 |
| 3,962 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 7.0625443e-05 |
| 976 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00012949951 |
| 288 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022437469 |
| 9,950 | Parallel Colorful h-star Core Maintenance in Dynamic Graphs | 2023 | VLDB | 5.226858e-05 |
| 5,089 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB | 6.4341076e-05 |
| 6,062 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD | 6.0525723e-05 |
| 5,649 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 6.1999762e-05 |
| 2,807 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.158882e-05 |