Approximating Betweenness Centrality in Large Evolving Networks

DOI10.1137/1.9781611973754.12zbMath1429.68175arXiv1409.6241OpenAlexW2963957156MaRDI QIDQ5232530

Elisabetta Bergamini, Henning Meyerhenke, Christian L. Staudt

Publication date: 12 September 2019

Published in: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.6241

Mathematics Subject Classification ID

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

Related Items (5)

Improving the Betweenness Centrality of a Node by Adding Links ⋮ Fast approximation of betweenness centrality through sampling ⋮ On the maximum betweenness improvement problem ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks ⋮ Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

This page was built for publication: Approximating Betweenness Centrality in Large Evolving Networks