Better Approximation of Betweenness Centrality

DOI10.1137/1.9781611972887.9zbMath1428.68213OpenAlexW4211173878MaRDI QIDQ5233512

Dominik Schultes, Robert Geisberger, Peter Sanders

Publication date: 11 September 2019

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

Full work available at URL: https://doi.org/10.1137/1.9781611972887.9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (18)

Improving the Betweenness Centrality of a Node by Adding Links ⋮ A Faster Algorithm to Update Betweenness Centrality after Node Alteration ⋮ Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality ⋮ Towards classifying the polynomial-time solvability of temporal betweenness centrality ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ Some results on approximate 1-median selection in metric spaces ⋮ An Adaptive Version of Brandes' Algorithm for Betweenness Centrality ⋮ Fully Dynamic 2-Hop Cover Labeling ⋮ Fast approximation of betweenness centrality through sampling ⋮ Efficient algorithms for updating betweenness centrality in fully dynamic graphs ⋮ On the maximum betweenness improvement problem ⋮ A Faster Algorithm to Update Betweenness Centrality After Node Alteration ⋮ Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks ⋮ Incorporating auxiliary information in betweenness measure for input-output networks ⋮ ReHub ⋮ Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

This page was built for publication: Better Approximation of Betweenness Centrality