Fully Dynamic Betweenness Centrality

DOI10.1007/978-3-662-48971-0_29zbMath1476.68215OpenAlexW2394524638MaRDI QIDQ3459873

Matteo Pontecorvi, Vijaya Ramachandran

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_29

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Improving the Betweenness Centrality of a Node by Adding Links ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks

This page was built for publication: Fully Dynamic Betweenness Centrality