ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages

Introduced ABRA, a suite of algorithms for approximating betweenness centrality in static and dynamic graphs using progressive random sampling and Rademacher averages. Demonstrated significant improvements in runtime and sample efficiency compared to existing methods for graph analysis.