Betweenness Centrality - Incremental and Faster

@article{Nasre2014BetweennessC,
  title={Betweenness Centrality - Incremental and Faster},
  author={Meghana Nasre and Matteo Pontecorvi and V. Ramachandran},
  journal={ArXiv},
  year={2014},
  volume={abs/1311.2147}
}
  • Meghana Nasre, Matteo Pontecorvi, V. Ramachandran
  • Published 2014
  • Mathematics, Computer Science
  • ArXiv
  • We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(v * · n) time, where v * is bounded by m *, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update problem. Even for a single edge update, our incremental algorithm is the first algorithm that is… CONTINUE READING
    44 Citations
    Scalable Online Betweenness Centrality in Evolving Graphs
    • 17
    • Highly Influenced
    • PDF
    A Faster Algorithm for Fully Dynamic Betweenness Centrality
    • 8
    • PDF
    Approximating Betweenness Centrality in Large Evolving Networks
    • 53
    • Highly Influenced
    • PDF
    Approximating Betweenness Centrality in Fully Dynamic Networks
    • 24
    • PDF
    Scaling Betweenness Centrality in Dynamic Graphs
    • A. Tripathy, Oded Green
    • Computer Science
    • 2018 IEEE High Performance extreme Computing Conference (HPEC)
    • 2018
    • 2
    An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
    • 7
    • PDF
    Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
    • 11
    • PDF
    Scalable online betweenness centrality in evolving graphs
    • 66
    • Highly Influenced
    • PDF
    Improving the Betweenness Centrality of a Node by Adding Links
    • 21
    • PDF

    References

    SHOWING 1-10 OF 46 REFERENCES
    Approximating Betweenness Centrality
    • 303
    • 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
    • 89
    • PDF
    QUBE: a quick algorithm for updating betweenness centrality
    • 91
    • PDF
    A Shortest Path Algorithm for Real-Weighted Undirected Graphs
    • 76
    • PDF
    A new approach to all-pairs shortest paths on real-weighted graphs
    • Seth Pettie
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2004
    • 158
    • PDF
    A Faster Algorithm to Update Betweenness Centrality after Node Alteration
    • 15
    A Faster Algorithm to Update Betweenness Centrality After Node Alteration
    • 22
    • PDF
    A faster algorithm for betweenness centrality
    • 3,260
    • PDF