Fully Dynamic Betweenness Centrality Maintenance on Massive Networks
Summary: First fully dynamic maintenance of all-vertex betweenness centrality, using a weighted shortest-path hypergraph sketch with accuracy guarantees. Two-ball and reachability indexes enable sub-millisecond updates on graphs with 106M vertices and 3.7B edges. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Takanori Hayashi (University of Tokyo)
- 2. Takuya Akiba (Chiba Institute of Technology; Japan Science and Technology Agency; National Institute of Informatics)
- 3. Yuichi Yoshida (National Institute of Informatics)
BibTeX Citation
@article{hayashi_vldb16,
title = {{Fully Dynamic Betweenness Centrality Maintenance on Massive Networks}},
author = {Hayashi, Takanori and Akiba, Takuya and Yoshida, Yuichi},
journal = {PVLDB},
series = {{VLDB} '16},
volume = {9},
number = {2},
pages = {48--59},
doi = {10.14778/2850583.2850589},
url = {https://doi.org/10.14778/2850583.2850589},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,271 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 9.7380494e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,011 | Efficient Star-based Truss Maintenance on Dynamic Graphs | 2023 | SIGMOD |
| 2 | 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 3 | 10,845 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB |
| 4 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 5 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 6 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 7 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 8 | 7,446 | Dynamic Influence Analysis in Evolving Networks | 2016 | VLDB |
| 9 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 10 | 11,271 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB |