Fetching the paper…
Reading the bibliography…
We present KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches on real-world complex networks.
A mathematical model for group structures
Alex Bavelas · 1948
Earlier work this paper cites.
Structural parameters of communication networks
Alfonso Shimbel · 1953
Earlier work this paper cites.
Group structure and the behavior of individuals in small groups
Marvin E Shaw · 1954
Earlier work this paper cites.
Networks and centres of integration in indian civilization
Bernard S Cohn and McKim Marriott · 1958
Earlier work this paper cites.
Bi-directional and heuristic search in path problems
Ira Pohl · 1969
Earlier work this paper cites.
The rush in a directed graph
Jac M Anthonisse · 1971
Earlier work this paper cites.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Béla Bollobás · 1980
Earlier work this paper cites.
Estimating the size of generalized transitive closures
Richard J. Lipton and Naughton, Jeffrey F · 1989
Earlier work this paper cites.
Social network analysis: Methods and applications
Stanley Wasserman and Katherine Faust · 1994
Earlier work this paper cites.
Query Size Estimation by Adaptive Sampling
Richard J. Lipton and Jeffrey F. Naughton · 1995
Earlier work this paper cites.
Bidirectional heuristic search reconsidered
Hermann Kaindl and Gerhard Kainz · 1997
Earlier work this paper cites.
A faster algorithm for betweenness centrality
Ulrik Brandes · 2001
Earlier work this paper cites.
Fast approximation of centrality
David Eppstein and Joseph Wang · 2001
Earlier work this paper cites.
Which Problems Have Strongly Exponential Complexity?
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane · 2001
Earlier work this paper cites.
Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality
Mark EJ Newman · 2001
Earlier work this paper cites.
Algorithms for centrality indices
Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, and Dagmar Tenfelde-Podehl · 2004
Earlier work this paper cites.
A graph-theoretic perspective on centrality
Stephen P. Borgatti and Martin G. Everett · 2006
Earlier work this paper cites.
Complex graphs and networks
Linyuan Lu and Fan R. K. Chung · 2006
Cited alongside, same era.
On a conditionally Poissonian graph process
Ilkka Norros and Hannu Reittu · 2006
Cited alongside, same era.
Approximating betweenness centrality
David A. Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail · 2007
Cited alongside, same era.
The phase transition in inhomogeneous random graphs
Béla Bollobás, Svante Janson, and Oliver Riordan · 2007
Cited alongside, same era.
Centrality Estimation in Large Networks
Ulrik Brandes and Christian Pich · 2007
Cited alongside, same era.
The diameter of sparse random graphs
Daniel Fernholz and Vijaya Ramachandran · 2007
Cited alongside, same era.
On variants of shortest-path betweenness centrality and their generic computation
BUbiNG: Massive crawling for the masses
Paolo Boldi, Andrea Marino, Massimo Santini, and Sebastiano Vigna · 2014
Later among the works it cites.
Networkit: an interactive tool suite for high-performance network analysis
Christian L. Staudt, Aleksejs Sazonovs, and Henning Meyerhenke · 2014
Later among the works it cites.
Random graphs and complex networks. Vol. II
Remco van der Hofstad · 2014
Later among the works it cites.
Finding orthogonal vectors in discrete structures
Ryan Williams and Huacheng Yu · 2014
Later among the works it cites.
Subcubic equivalences between graph centrality problems, apsp and diameter
Amir Abboud, Fabrizio Grandoni, and Virginia Vassilevska Williams · 2015
Later among the works it cites.
Fully-dynamic approximation of betweenness centrality
Elisabetta Bergamini and Henning Meyerhenke · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ulrik Brandes · 2008
Cited alongside, same era.
Contraction hierarchies: Faster and simpler hierarchical routing in road networks
Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling · 2008
Cited alongside, same era.
Adaptive Sampling for k-Means Clustering
Ankit Aggarwal, Amit Deshpande, and Ravi Kannan · 2009
Cited alongside, same era.
Routing betweenness centrality
Shlomi Dolev, Yuval Elovici, and Rami Puzis · 2010
Cited alongside, same era.
Networks, crowds, and markets - reasoning about a highly connected world
David A. Easley and Jon M. Kleinberg · 2010
Cited alongside, same era.
Networks: an introduction
Mark Newman · 2010
Cited alongside, same era.
Later among the works it cites.
Into the square - On the complexity of some quadratic-time solvable problems
Michele Borassi, Pierluig Crescenzi, and Michel Habib · 2015
Later among the works it cites.
A divide-and-conquer algorithm for betweenness centrality
Dóra Erdős, Vatche Ishakian, Azer Bestavros, and Evimaria Terzi · 2015
Later among the works it cites.
Fast approximation of betweenness centrality through sampling
Matteo Riondato and Evgenios M Kornaropoulos · 2015
Later among the works it cites.
Approximation and fixed parameter subquadratic algorithms for radius and diameter
Amir Abboud, Virginia V. Williams, and Joshua Wang · 2016
Closest in time.
private communication, 2016
Elisabetta Bergamini · 2016
Closest in time.
Computing top-k closeness centrality faster in unweighted graphs
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, and Henning Meyerhenke · 2016
Closest in time.
Michele Borassi, Pierluigi Crescenzi, and Luca Trevisan · 2016
Closest in time.
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages
Matteo Riondato and Eli Upfal · 2016
Closest in time.
Algorithms and heuristics for scalable betweenness centrality computation on multi-gpu systems
Flavio Vella, Giancarlo Carbone, and Massimo Bernaschi · 2016
Closest in time.
private communication, 2016
Sebastiano Vigna · 2016
Closest in time.