, 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.

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

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

Routing betweenness centrality, J. ACM, vol.57, 2010. ,

Networks, crowds, and markets -reasoning about a highly connected world, DAGLIB, 2010. ,

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

A divide-and-conquer algorithm for betweenness centrality, Proceedings of the 2015 SIAM International Conference on Data Mining, pp.433-441, 2015. ,

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

Contraction hierarchies: Faster and simpler hierarchical routing in road networks, Experimental Algorithms: 7th International Workshop, pp.319-333, 2008. ,

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

, Algorithms for centrality indices. In DAGSTUHL, 2004.

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

Online estimating the k central nodes of a network, Proceedings of IEEE NSW, pp.118-122, 2011. ,

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

Estimating the size of generalized transitive closures, Proceedings of the 15th Int. Conf. on Very Large Data Bases, 1989. ,

Complex graphs and networks. Number no. 107 in CBMS regional conference series in mathematics, 2006. ,

Networks: an introduction, 2010. ,