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 (Wuhan University)
- 2. Yuanyuan Zhu (Wuhan University)
- 3. Lijun Chang (University of Sydney)
BibTeX Citation
@inproceedings{zhang_sigmod25,
title = {{A Local Search Approach to Efficient (k, p)-Core Maintenance}},
author = {Zhang, Chenghan and Zhu, Yuanyuan and Chang, Lijun},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709654},
url = {https://dl.acm.org/doi/10.1145/3709654},
year = {2025}
}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 |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 706 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014789612 |
| 793 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00013978774 |
| 1,069 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00012323497 |
| 2,243 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.8813183e-05 |
| 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.0865974e-05 |
| 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.9619668e-05 |
| 4,485 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 6.6715036e-05 |
| 7,408 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 5.6243648e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 2 | 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB |
| 3 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 4 | 982 | Influential Community Search in Large Networks | 2015 | VLDB |
| 5 | 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD |
| 6 | 10,100 | Parallel Colorful h-star Core Maintenance in Dynamic Graphs | 2023 | VLDB |
| 7 | 5,149 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB |
| 8 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 9 | 5,697 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB |
| 10 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |