An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

  title={An Adaptive Version of Brandes' Algorithm for Betweenness Centrality},
  author={M. Bentert and A. Dittmann and Leon Kellerhals and A. Nichterlein and R. Niedermeier},
  • M. Bentert, A. Dittmann, +2 authors R. Niedermeier
  • Published in ISAAC 2018
  • Computer Science, Mathematics
  • Betweenness centrality - measuring how many shortest paths pass through a vertex - is one of the most important network analysis concepts for assessing the relative importance of a vertex. [...] Key Method We further contribute an algorithmic treatment of degree-two vertices, which turns out to be much richer in mathematical structure than the case of degree-one vertices. Based on these three algorithmic ingredients, we provide a strengthened worst-case running time analysis for betweenness centrality…Expand Abstract
    7 Citations


    Approximating Betweenness Centrality
    • 300
    • PDF
    A Fast Algorithm for Streaming Betweenness Centrality
    • Oded Green, R. McColl, David A. Bader
    • Mathematics, Computer Science
    • 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
    • 2012
    • 85
    • PDF
    Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
    • 7
    QUBE: a quick algorithm for updating betweenness centrality
    • 87
    • PDF
    A divide-and-conquer algorithm for betweenness centrality
    • 11
    Betweenness Centrality - Incremental and Faster
    • 42
    • PDF
    Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
    • 109
    • PDF
    Better Approximation of Betweenness Centrality
    • 207
    • PDF
    Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs
    • 9
    • PDF
    Graph Manipulations for Fast Centrality Computation
    • 16
    • Highly Influential
    • PDF