Fully Dynamic Betweenness Centrality Maintenance on Massive Networks
Summary: Fully dynamic method for maintaining betweenness centrality of all vertices in massive networks. Uses a weighted hyperedge shortest-path sketch (hypergraph sketch) plus two indices (two-ball, reachability) to accelerate updates, delivering millisecond updates on 100M–3.7B-edge graphs with accuracy guarantees, and experiments show real-world scalability across large networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Takanori Hayashi
- 2. Takuya Akiba
- 3. Yuichi Yoshida
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,067 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 4.1905499e-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,776 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.0001058029 |
Previous
Page 1 / 1
Next