, Ulrik Brandes. A faster algorithm for betweenness centrality, The Journal of Mathematical Sociology, vol.25, issue.2, pp.163-177, 2001.

, On variants of shortest-path betweenness centrality and their generic computation, Social Networks, vol.30, pp.136-145, 2008.

U. Brandes and C. Pich, Centrality Estimation in Large Networks, International Journal of Bifurcation and Chaos, vol.17, issue.07, pp.2303-2318, 2007.

S. Bernard, M. Cohn, and . Marriott, Networks and centres of integration in indian civilization, Journal of social Research, vol.1, issue.1, pp.1-9, 1958.

S. Dolev, Y. Elovici, and R. Puzis, Routing betweenness centrality, J. ACM, vol.57, 2010.

A. David, J. M. Easley, and . Kleinberg, Networks, crowds, and markets -reasoning about a highly connected world, DAGLIB, 2010.

D. Eppstein and J. Wang, Fast approximation of centrality, J. Graph Algorithms Appl, vol.8, pp.39-45, 2001.

D. Erds, V. Ishakian, A. Bestavros, and E. Terzi, A divide-and-conquer algorithm for betweenness centrality, Proceedings of the 2015 SIAM International Conference on Data Mining, pp.433-441, 2015.

D. Fernholz and V. Ramachandran, The diameter of sparse random graphs, Random Structures and Algorithms, vol.31, issue.4, pp.482-516, 2007.

R. Geisberger, P. Sanders, D. Schultes, and D. Delling, Contraction hierarchies: Faster and simpler hierarchical routing in road networks, Experimental Algorithms: 7th International Workshop, pp.319-333, 2008.

R. Impagliazzo, R. Paturi, and F. Zane, Which Problems Have Strongly Exponential Complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001.

R. Jacob, D. Koschützki, K. A. Lehmann, L. Peeters, and D. Tenfelde-podehl, Algorithms for centrality indices. In DAGSTUHL, 2004.

H. Kaindl and G. Kainz, Bidirectional heuristic search reconsidered, J. Artif. Intell. Res. (JAIR), vol.7, pp.283-317, 1997.

Y. Lim, S. Daniel, B. Menasché, D. Ribeiro, P. Towsley et al., Online estimating the k central nodes of a network, Proceedings of IEEE NSW, pp.118-122, 2011.

J. Richard, J. F. Lipton, and . Naughton, Query Size Estimation by Adaptive Sampling, Journal of Computer and System Sciences, vol.51, issue.1, pp.18-25, 1995.

J. Richard, . Lipton, and J. F. Naughton, Estimating the size of generalized transitive closures, Proceedings of the 15th Int. Conf. on Very Large Data Bases, 1989.

L. Lu and F. R. Chung, Complex graphs and networks. Number no. 107 in CBMS regional conference series in mathematics, 2006.

M. Newman, Networks: an introduction, 2010.