Fully dynamic betweenness centrality

DOI10.1007/978-3-662-48971-0_29MaRDI QIDQ3459873zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
• Fully-dynamic approximation of betweenness centrality
• Betweenness centrality -- incremental and faster
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs

Cited in

(6)

• Betweenness centrality -- incremental and faster
• Fully-dynamic approximation of betweenness centrality
• Improving the betweenness centrality of a node by adding links
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• Computing Top-k Closeness Centrality in Fully-dynamic Graphs
• Approximating Betweenness Centrality in Fully Dynamic Networks

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)