Fully Dynamic Betweenness Centrality

DOI10.1007/978-3-662-48971-0_29zbMATH Open1476.68215OpenAlexW2394524638MaRDI QIDQ3459873FDOQ3459873

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

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

Cited In (3)

• Approximating Betweenness Centrality in Fully Dynamic Networks
• Improving the Betweenness Centrality of a Node by Adding Links
• Computing Top-k Closeness Centrality in Fully-dynamic Graphs

This page was built for publication: Fully Dynamic Betweenness Centrality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459873)