ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages
Published on Sep 27, 20161328 Views
We present ABRA, a suite of algorithms to compute and maintain probabilistically-guaranteed, high-quality, approximations of the betweenness centrality of all nodes (or edges) on both static and fully