K. Avrachenkov and N. Litvak, The Effect of New Links on Google Pagerank, Stochastic Models, vol.22, issue.2, pp.319-331, 2006.
DOI : 10.1080/15427951.2004.10129091
URL : https://hal.archives-ouvertes.fr/inria-00070742

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

B. Bollobás, C. Borgs, J. Chayes, and O. Riordan, Directed scale-free graphs, Proc. of the 14th Annu. ACM-SIAM Symp. on Disc. Alg. (SODA), pp.132-139, 2003.

U. Brandes, A faster algorithm for betweenness centrality*, The Journal of Mathematical Sociology, vol.113, issue.2, pp.163-177, 2001.
DOI : 10.1017/CBO9780511815478
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2024

F. Chierichetti, R. Kumar, S. Lattanzi, A. Panconesi, and P. Raghavan, Models for the compressible web, Proc. of the 50th Annu. Symp. on Found. of Comput. Sci. (FOCS), pp.331-340, 2009.
DOI : 10.1109/focs.2009.63
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.906

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, 2014.
DOI : 10.1145/2660460.2660465
URL : http://arxiv.org/pdf/1409.0035

E. D. Demaine and M. Zadimoghaddam, Minimizing the Diameter of a Network Using Shortcut Edges, SWAT 2010, pp.420-431, 2010.
DOI : 10.1007/978-3-642-13731-0_39

P. Erd?-os and A. Rényi, On random graphs I, Publ. Math, vol.6, pp.290-297, 1959.

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, 1998.
DOI : 10.1145/285055.285059

V. Ishakian, D. Erdös, E. Terzi, and A. Bestavros, A Framework for the Evaluation and Management of Network Centrality, Proc. of the 12th SIAM Int. Conf. on Data Mining (SDM), pp.427-438, 2012.
DOI : 10.1137/1.9781611972825.37

R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins et al., Stochastic models for the Web graph, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.57-65, 2000.
DOI : 10.1109/SFCS.2000.892065
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.478

J. Kunegis, KONECT -The Koblenz network collection, Proc. of the 1st Int. Web Observatory Work. (WOW), pp.1343-1350, 2013.

P. Malighetti, G. Martini, S. Paleari, and R. Redondi, The impacts of airport centrality in the EU network and inter-airport competition on airport efficiency, 2009.

A. Meyerson, B. Tagiku, I. Dinur, K. Jansen, J. Naor et al., Minimizing Average Shortest Path Distances via Shortcut Edge Addition, Approximation, Randomization, and Combinatorial Optimization, pp.272-285, 2009.
DOI : 10.1007/978-3-642-03685-9_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5015

G. Nemhauser, L. Wolsey, and M. Fisher, An analysis of approximations for maximizing submodular set functions?I, Mathematical Programming, vol.16, issue.1, pp.265-294, 1978.
DOI : 10.1007/BF01588971

M. Olsen and A. Viglas, On the approximability of the link building problem, Theoretical Computer Science, vol.518, pp.96-116, 2014.
DOI : 10.1016/j.tcs.2013.08.003

M. Riondato and E. M. Kornaropoulos, Fast approximation of betweenness centrality through sampling, Proc. of the 7th ACM Int. Conf. on Web Search and Data Mining, pp.413-422, 2014.
DOI : 10.1145/2556195.2556224

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

D. Williamson and D. Shmoys, The Design of Approximation Algorithms, 2011.
DOI : 10.1017/CBO9780511921735

E. Yan and Y. Ding, Applying centrality measures to impact analysis: A coauthorship network analysis, Journal of the American Society for Information Science and Technology, vol.42, issue.1, pp.2107-2118, 2009.
DOI : 10.1017/CBO9780511815478
URL : http://arxiv.org/abs/1012.4862