A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V, E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν * 2 · log 3 n) time per update with our basic algorithm, and O(ν * 2 · log 2 n) time with a more complex algorithm, where n = |V |, and ν * bounds the number of distinct edges that lie on shortest paths through any single vertex. For graphs with νdoi:10.1007/978-3-662-48971-0_29 fatcat:yh7hl4aapvgijgcajrvbejnqym