Back to papers
Hierarchical Core Maintenance on Large Dynamic Graphs
Summary: Hierarchical k-core maintenance for dynamic graphs; incrementally updates the k-core hierarchy by exploiting inter-core relations. Local update techniques target affected areas via structural properties, achieving up to 1,000× speedups on 10 real-world graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12592
- Venue
- VLDB
- Year
- 2021
- Pagerank
- 7.223972e-05
- Overall Rank
- 3,321 | 76.90%
- DOI
-
10.14778/3446095.3446099
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,843 |
Butterfly-Core Community Search over Labeled Graphs |
2021 |
VLDB |
5.8823824e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 6,725 |
Maximal D-truss Search in Dynamic Directed Graphs |
2023 |
VLDB |
4.9484066e-05 |
| 6,880 |
Theoretically and Practically Efficient Parallel Nucleus Decomposition |
2022 |
VLDB |
4.8970985e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 8,169 |
Efficient Triangle-Connected Truss Community Search In Dynamic Graphs |
2023 |
VLDB |
4.5698941e-05 |
| 9,482 |
MCR-Tree: An Efficient Index for Multi-dimensional Core Search |
2024 |
SIGMOD |
4.3341665e-05 |
| 9,951 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
4.2405999e-05 |
| 10,159 |
Efficient Influential Community Search over Dynamic Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,246 |
Anchored Maximum Communities over Large Directed Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,363 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,947 |
Parallel Algorithms for Hierarchical Nucleus Decomposition |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,044 |
Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation |
2024 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 108 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048300163 |
| 283 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029041257 |
| 331 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027214222 |
| 686 |
Finding Maximal Cliques in Massive Networks by H*-graph |
2010 |
SIGMOD |
0.00018178029 |
| 738 |
Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis |
2013 |
VLDB |
0.00017435236 |
| 966 |
Streaming Algorithms for k-core Decomposition |
2013 |
VLDB |
0.00014960672 |
| 1,150 |
K-Core Decomposition of Large Networks on a Single PC |
2016 |
VLDB |
0.00013657353 |
| 1,257 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00013020648 |
| 1,720 |
Incremental Graph Pattern Matching |
2011 |
SIGMOD |
0.00010779343 |
| 1,777 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.00010589591 |
| 1,844 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
0.00010341077 |
| 2,512 |
Fast Hierarchy Construction for Dense Subgraphs |
2017 |
VLDB |
8.6196023e-05 |
| 2,603 |
Maximum Co-located Community Search in Large Scale Social Networks |
2018 |
VLDB |
8.4666465e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 3,129 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.5008242e-05 |
| 3,273 |
Global Reinforcement of Social Networks: The Anchored Coreness Problem |
2020 |
SIGMOD |
7.2956944e-05 |
| 3,603 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
6.9306814e-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 |
| 4,921 |
Efficient Cohesive Subgraphs Detection in Parallel |
2014 |
SIGMOD |
5.8237536e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.0020648e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,512 |
Fast Hierarchy Construction for Dense Subgraphs |
2017 |
VLDB |
8.6196023e-05 |
| 8,542 |
Fully Dynamic Betweenness Centrality Maintenance on Massive Networks |
2016 |
VLDB |
4.4937074e-05 |
| 10,189 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 10,363 |
A Local Search Approach to Efficient (k, p)-Core Maintenance |
2025 |
SIGMOD |
4.1945683e-05 |
| 9,146 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
4.3849295e-05 |
| 966 |
Streaming Algorithms for k-core Decomposition |
2013 |
VLDB |
0.00014960672 |
| 10,134 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 9,951 |
Parallel Colorful h-star Core Maintenance in Dynamic Graphs |
2023 |
VLDB |
4.2405999e-05 |
| 6,141 |
Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs |
2021 |
VLDB |
5.1903263e-05 |