An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

DOI10.4230/LIPIcs.ISAAC.2018.36OpenAlexW2900299369MaRDI QIDQ5091028

Alexander J. Dittmann, Rolf Niedermeier, Matthias Bentert, André Nichterlein, Leon Kellerhals

Publication date: 21 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2018.36

zbMATH Keywords

shortest pathsnetwork sciencecentrality measuressocial network analysistree-like graphsFPT in Pefficient pre- and postprocessing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Parameterized aspects of triangle enumeration ⋮ When can graph hyperbolicity be computed in linear time? ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph

Cites Work

• Unnamed Item
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
• A faster algorithm for betweenness centrality*
• On Tractable Cases of Target Set Selection
• Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter

This page was built for publication: An Adaptive Version of Brandes' Algorithm for Betweenness Centrality