A. Abboud, F. Grandoni, and V. V. Williams, Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter, Proceedings of the 26th ACM/SIAM Symposium on Discrete Algorithms (SODA), pp.1681-1697, 2015.
DOI : 10.1137/1.9781611973730.112

A. Abboud and V. V. Williams, Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp.434-443, 2014.
DOI : 10.1109/FOCS.2014.53

A. Abboud, V. V. Williams, and J. Wang, Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter, Proceedings of the 27th ACM/SIAM Symposium on Discrete Algorithms (SODA), pp.377-391, 2016.

A. Abboud, V. V. Williams, and O. Weimann, Consequences of Faster Alignment of Sequences, Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP), pp.39-51, 2014.
DOI : 10.1007/978-3-662-43948-7_4

A. Bavelas, Communication Patterns in Task???Oriented Groups, The Journal of the Acoustical Society of America, vol.22, issue.6, pp.725-730, 1950.
DOI : 10.1121/1.1906679

E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke, Closeness Centrality Faster in Unweighted Graphs, 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2016.
DOI : 10.1137/1.9781611974317.6
URL : https://hal.archives-ouvertes.fr/hal-01390137

P. Boldi and S. Vigna, In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond, 2013 IEEE 13th International Conference on Data Mining Workshops, pp.621-628, 2013.
DOI : 10.1109/ICDMW.2013.10

P. Boldi and S. Vigna, Axioms for Centrality, Internet Mathematics, vol.10, issue.3-4, pp.222-262, 2014.
DOI : 10.1080/15427951.2013.865686

M. Borassi, A note on the complexity of computing the number of reachable vertices in a digraph, Information Processing Letters, vol.116, issue.10, 2016.
DOI : 10.1016/j.ipl.2016.05.002

M. Borassi, P. Crescenzi, and M. Habib, Into the Square: On the Complexity of Some Quadratic-time Solvable Problems, Proceedings of the 16th Italian Conference on Theoretical Computer Science (ICTCS), pp.1-17, 2015.
DOI : 10.1016/j.entcs.2016.03.005
URL : https://hal.archives-ouvertes.fr/hal-01390131

D. Chen, L. Lu, M. Shang, Y. Zhang, and T. Zhou, Identifying influential nodes in complex networks. Physica A: Statistical Mechanics and its Applications, pp.1777-1787, 2012.

E. Cohen, D. Delling, T. Pajor, and R. F. Werneck, Computing classic closeness centrality, at scale, Proceedings of the second edition of the ACM conference on Online social networks, COSN '14, pp.37-50, 2014.
DOI : 10.1145/2660460.2660465
URL : http://arxiv.org/abs/1409.0035

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, 2009.

G. Csárdi and T. Nepusz, The igraph software package for complex network research, InterJournal, 2006.

D. Eppstein and J. Wang, Fast Approximation of Centrality, Journal of Graph Algorithms and Applications, pp.39-45, 2004.

A. Aric, D. A. Hagberg, P. J. Schult, and . Swart, Exploring network structure, dynamics, and function using NetworkX, Proceedings of the 7th Python in Science Conference (SCIPY), pp.11-15, 2008.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516

U. Kang, S. Papadimitriou, J. Sun, and T. Hanghang, Centralities in Large Networks: Algorithms and Observations, Proceedings of the SIAM International Conference on Data Mining (SDM), pp.119-130, 2011.
DOI : 10.1137/1.9781611972818.11

N. L. Erwan-le-merrer, G. Scouarnec, and . Trédan, Heuristical top-k: fast estimation of centralities in complex networks, Information Processing Letters, vol.114, issue.8, pp.432-436, 2014.
DOI : 10.1016/j.ipl.2014.03.006

Y. Lim, D. S. Menasché, B. Ribeiro, D. Towsley, and P. Basu, Online estimating the k central nodes of a network, 2011 IEEE Network Science Workshop, pp.118-122, 2011.
DOI : 10.1109/NSW.2011.6004633

N. Lin, Foundations of social research, 1976.

E. J. Mark and . Newman, Networks: An Introduction, OUP Oxford, 2010.

K. Okamoto, W. Chen, and X. Li, Ranking of Closeness Centrality for Large-Scale Social Networks, Frontiers in Algorithmics, vol.5059, pp.186-195, 2008.
DOI : 10.1007/978-3-540-69311-6_21

P. W. Olsen, A. G. Labouseur, and J. Hwang, Efficient top-k closeness centrality search, 2014 IEEE 30th International Conference on Data Engineering, pp.196-207, 2014.
DOI : 10.1109/ICDE.2014.6816651

M. P?atra?cup?atra?cu and R. Williams, On the possibility of faster SAT algorithms, Proceedings of the 21st ACM/SIAM Symposium on Discrete Algorithms (SODA), 2010.

L. Roditty and V. V. Williams, Fast approximation algorithms for the diameter and radius of sparse graphs, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.515-524, 2013.
DOI : 10.1145/2488608.2488673

A. E. Sariyüce, K. Kaya, E. Saule, and U. V. Catalyurek, Incremental algorithms for closeness centrality, 2013 IEEE International Conference on Big Data, pp.118-122, 2013.
DOI : 10.1109/BigData.2013.6691611

J. G. Siek, A. Lie-quan-lee, and . Lumsdaine, The Boost Graph Library: User Guide and Reference Manual, 2001.

C. Staudt, A. Sazonovs, and H. Meyerhenke, Networkit: An interactive tool suite for high-performance network analysis. arXiv preprint 1403, 2014.

W. Stein and D. Joyner, SAGE, ACM SIGSAM Bulletin, vol.39, issue.2, pp.61-64, 2005.
DOI : 10.1145/1101884.1101889

S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications . Structural Analysis in the Social Sciences, 1994.
DOI : 10.1017/CBO9780511815478

R. Williams, A new algorithm for optimal 2-constraint satisfaction and its implications, Theoretical Computer Science, vol.348, issue.2-3, pp.357-365, 2005.
DOI : 10.1016/j.tcs.2005.09.023

V. V. Williams, Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012.
DOI : 10.1145/2213977.2214056
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.2680

V. Virginia, R. Williams, and . Williams, Subcubic Equivalences between Path, Matrix and Triangle Problems, Proceedings of the 51st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp.645-654, 2010.

U. Zwick, All pairs shortest paths using bridging sets and rectangular matrix multiplication, Journal of the ACM, vol.49, issue.3, p.27, 2002.
DOI : 10.1145/567112.567114
URL : http://arxiv.org/abs/cs/0008011