Betweenness Centrality – Incremental and Faster
From MaRDI portal
Publication:2922644
DOI10.1007/978-3-662-44465-8_49zbMath1407.68368arXiv1311.2147OpenAlexW1603540962WikidataQ62045767 ScholiaQ62045767MaRDI QIDQ2922644
Meghana Nasre, Vijaya Ramachandran, Matteo Pontecorvi
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2147
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
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, A Faster Algorithm to Update Betweenness Centrality After Node Alteration, Approximating Betweenness Centrality in Fully Dynamic Networks
