Fetching the paper…
Reading the bibliography…
Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\frac{n-1}{\sum_{w \in V} d(v,w)}$.
Communication patterns in task-oriented groups
Alex Bavelas. 1950 · 1950
Earlier work this paper cites.
Foundations of social research
Nan Lin. 1976 · 1976
Earlier work this paper cites.
Social Network Analysis: Methods and Applications
Stanley Wasserman and Katherine Faust. 1994 · 1994
Earlier work this paper cites.
Harmony in the small-world
Massimo Marchiori and Vito Latora. 2000 · 2000
Earlier work this paper cites.
Which Problems Have Strongly Exponential Complexity?
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. 2001 · 2001
Earlier work this paper cites.
The Boost Graph Library: User Guide and Reference Manual
Jeremy G. Siek, Lie Quan Lee, and Andrew Lumsdaine. 2001 · 2001
Earlier work this paper cites.
All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication
Uri Zwick. 2002 · 2002
Earlier work this paper cites.
Fast Approximation of Centrality
David Eppstein and Joseph Wang. 2004 · 2004
Earlier work this paper cites.
Centrality Measures Based on Current Flow. In STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings
Ulrik Brandes and Daniel Fleischer. 2005 · 2005
Earlier work this paper cites.
Sage: System for algebra and geometry experimentation
William Stein and David Joyner. 2005 · 2005
Earlier work this paper cites.
A new algorithm for optimal 2-constraint satisfaction and its implications
Ryan Williams. 2005 · 2005
Earlier work this paper cites.
The igraph software package for complex network research
Gábor Csárdi and Tamás Nepusz. 2006 · 2006
Earlier work this paper cites.
Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference (SCIPY)
Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008 · 2008
Earlier work this paper cites.
Ranking of closeness centrality for large-scale social networks
Kazuya Okamoto, Wei Chen, and XY Li. 2008 · 2008
Cited alongside, same era.
Introduction to Algorithms (3rd edition)
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009 · 2009
Cited alongside, same era.
Networks: An Introduction
Mark E. J. Newman. 2010 · 2010
Cited alongside, same era.
On the possibility of faster SAT algorithms
Mihai Pǎtraşcu and Ryan Williams. 2010 · 2010
Cited alongside, same era.
Subcubic Equivalences between Path, Matrix and Triangle Problems
Virginia V. Williams and Ryan Williams. 2010 · 2010
Cited alongside, same era.
Identifying influential nodes in complex networks
Duanbing Chen, Linyuan Lu, Ming-Sheng Shang, Yi-Cheng Zhang, and Tao Zhou. 2012 · 2011
Cited alongside, same era.
Popular conjectures imply strong lower bounds for dynamic problems
Amir Abboud and Virginia V. Williams. 2014 · 2014
Later among the works it cites.
Consequences of Faster Alignment of Sequences. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP)
Amir Abboud, Virginia V. Williams, and Oren Weimann. 2014 · 2014
Later among the works it cites.
Computing classic closeness centrality, at scale. In Proceedings of the 2nd ACM conference on Online social networks (COSN)
Edith Cohen, Daniel Delling, Thomas Pajor, and Renato F. Werneck. 2014 · 2014
Later among the works it cites.
Heuristical Top-k: Fast Estimation of Centralities in Complex Networks
Erwan Le Merrer, Nicolas Le Scouarnec, and Gilles Trédan. 2014 · 2014
Later among the works it cites.
Efficient top-k closeness centrality search. In Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Centralities in large networks: Algorithms and observations. In Proceedings of the SIAM International Conference on Data Mining (SDM)
U Kang, Spiros Papadimitriou, Jimeng Sun, and Tong Hanghang. 2011 · 2011
Cited alongside, same era.
Online estimating the k central nodes of a network. In Proceedings of the 2011 IEEE Network Science Workshop (NS)
Yeon-sup Lim, Daniel S. Menasché, Bruno Ribeiro, Don Towsley, and Prithwish Basu. 2011 · 2011
Cited alongside, same era.
Multiplying Matrices Faster Than Coppersmith-Winograd. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC)
Virginia V. Williams. 2012 · 2012
Cited alongside, same era.
In-core computation of geometric centralities with hyperball: A hundred billion nodes and beyond. In Proceedings of the 13th IEEE International Conference on Data Mining Workshops (ICDM)
Paolo Boldi and Sebastiano Vigna. 2013 · 2013
Cited alongside, same era.
Axioms for centrality
Paolo Boldi and Sebastiano Vigna. 2014 · 2013
Cited alongside, same era.
Fast approximation algorithms for the diameter and radius of sparse graphs. In Proceedings of the 45th annual ACM Symposium on Theory of Computing (STOC)
Liam Roditty and Virginia V. Williams. 2013 · 2013
Cited alongside, same era.
Paul W. Olsen, Alan G. Labouseur, and Jeong-Hyon Hwang. 2014 · 2014
Later among the works it cites.
NetworKit: An Interactive Tool Suite for High-Performance Network Analysis
Christian Staudt, Aleksejs Sazonovs, and Henning Meyerhenke. 2014 · 2014
Later among the works it cites.
Subcubic equivalences between graph centrality problems, APSP and diameter. In Proceedings of the 26th ACM/SIAM Symposium on Discrete Algorithms (SODA)
Amir Abboud, Fabrizio Grandoni, and Virginia V. Williams. 2015 · 2015
Later among the works it cites.
Michele Borassi, Pierluigi Crescenzi, and Michel Habib. 2015 · 2015
Later among the works it cites.
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015
Shiri Chechik, Edith Cohen, and Haim Kaplan. 2015 · 2015
Later among the works it cites.
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter. In Proceedings of the 27th ACM/SIAM Symposium on Discrete Algorithms (SODA)
Amir Abboud, Virginia V. Williams, and Joshua Wang. 2016 · 2016
Later among the works it cites.
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph
Michele Borassi. 2016 · 2016
Later among the works it cites.
Distributed computation of classic and exponential closeness on tree graphs. In Proceedings of the American Control Conference, ACC 2014, Portland, OR, USA, June 4-6, 2014
Wei Wang and Choon Yik Tang. 2014 · 2095
Closest in time.