Approximating Betweenness Centrality

DOI10.1007/978-3-540-77004-6_10zbMath1136.68320OpenAlexW1527104720MaRDI QIDQ5458305

Kamesh Madduri, David A. Bader, Milena Mihail, Shiva Kintali

Publication date: 11 April 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77004-6_10

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (17)

Fully-Dynamic Approximation of Betweenness Centrality ⋮ 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 ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ Fast approximation of betweenness centrality through sampling ⋮ The critical node detection problem in networks: a survey ⋮ Efficient algorithms for updating betweenness centrality in fully dynamic graphs ⋮ Centrality measure in graphs ⋮ Into the square: on the complexity of some quadratic-time solvable problems ⋮ A Faster Algorithm to Update Betweenness Centrality After Node Alteration ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks ⋮ Incorporating auxiliary information in betweenness measure for input-output networks ⋮ Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

This page was built for publication: Approximating Betweenness Centrality