Approximating Betweenness Centrality in Fully Dynamic Networks

DOI10.1080/15427951.2016.1177802zbMath1461.68142arXiv1510.07971OpenAlexW2284958355MaRDI QIDQ5856439

Elisabetta Bergamini, Henning Meyerhenke

Publication date: 26 March 2021

Published in: Internet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

Compressive sensing of high betweenness centrality nodes in networks ⋮ Improving the Betweenness Centrality of a Node by Adding Links ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time

Uses Software

• KONECT
• NetworKit

Cites Work

• Unnamed Item
• KONECT
• On dynamic shortest paths problems
• Semidynamic algorithms for maintaining single-source shortest path trees
• Fast approximation of betweenness centrality through sampling
• A faster algorithm for betweenness centrality*
• Betweenness Centrality – Incremental and Faster
• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• Fully-Dynamic Approximation of Betweenness Centrality
• Fully Dynamic Betweenness Centrality
• Generating Random Hyperbolic Graphs in Subquadratic Time
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Approximating Betweenness Centrality in Large Evolving Networks
• Better Approximation of Betweenness Centrality
• Approximating Betweenness Centrality
• CENTRALITY ESTIMATION IN LARGE NETWORKS

This page was built for publication: Approximating Betweenness Centrality in Fully Dynamic Networks