Approximating Betweenness Centrality

By David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail. Workshop on Algorithms and Models for the Web-Graph, 2007

375 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Centrality measure in graphs (2010, background): “[1,2,6,13,21,29,31,38,42,43] different efficient means have been sought [8,42,43, 47,48] for the computation of different centrality measures, further mathematical results have been enunciated [43,45,46,49,50] and comparisons of different definitions have been made [51–55].”
Finding and Characterizing Information Warfare Campaigns (2020, methodology): “Our model includes several network centrality measures: degree centrality, kbetweenness [21], and eigenvector centrality [136] are used to measure differing “compactness” between human and bot conversation networks.”
Fast shortest path distance estimation in large networks (2009, background): “[4] gave a sampling-based approximation algorithm and showed that centrality is easier to approximate for central nodes.”
The Combinatorial BLAS: design, implementation, and applications (2011, background): “Bader et al. (2007) propose an unbiased estimator of betweenness centrality that is based on sampling nodes from which to compute single-source shortest paths.”