DBScholar

Back to papers

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)

Paper ID
11526
Venue
VLDB
Year
2016
Pagerank
5.3766157e-05
Overall Rank
8,746 | 40.00%
DOI
10.14778/2850583.2850589

Incoming Non-self Citations Over Time

Authors

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