V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, and Y. Vaxès, Notes on diameters, centers, and approximating trees of ??-hyperbolic geodesic spaces and graphs, Proceedings of the 24th Annual Symposium on Computational Geometry, pp.59-68, 2008.
DOI : 10.1016/j.endm.2008.06.046

F. Chierichetti, R. Kumar, S. Lattanzi, A. Panconesi, and P. Raghavan, Models for the compressible web, Proceedings of the 50th IEEE Symposium on Foundations of Computer Science (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

F. Chung and L. Lu, Complex graphs and networks, 2006.
DOI : 10.1090/cbms/107

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

P. Crescenzi, R. Grossi, M. Habib, L. Lanzi, and A. Marino, On computing the diameter of real-world undirected graphs, Theoretical Computer Science, vol.514, pp.84-95, 2013.
DOI : 10.1016/j.tcs.2012.09.018
URL : https://hal.archives-ouvertes.fr/hal-00936304

D. Delling, A. V. Goldberg, and R. F. Werneck, Hub Label Compression, Proceedings of the 12th International Symposium on Experimental Algorithms (SEA), pp.18-29, 2013.
DOI : 10.1007/978-3-642-38527-8_4

D. Delling and R. F. Werneck, Faster Customization of Road Networks, Proceedings of the 12th International Symposium on Experimental Algorithms (SEA), pp.30-42, 2013.
DOI : 10.1007/978-3-642-38527-8_5

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

A. Frieze and C. Mcdiarmid, Algorithmic theory of random graphs. Random Structures and Algorithms, pp.5-42, 1997.
DOI : 10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.3.co;2-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.3120

V. Andrew, C. Goldberg, and . Harrelson, Computing the shortest path: A* search meets graph theory, Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.156-165, 2005.

M. Gromov, Hyperbolic groups. Essays in Group Theory, pp.75-265, 1987.

R. Gupta, T. Roughgarden, and C. Seshadhri, Decompositions of Triangle-Dense Graphs, SIAM Journal on Computing, vol.45, issue.2, pp.197-215, 2016.
DOI : 10.1137/140955331
URL : http://arxiv.org/abs/1309.7440

J. Leskovec and R. Sosi?, SNAP, ACM Transactions on Intelligent Systems and Technology, vol.8, issue.1, 2014.
DOI : 10.1145/2898361

C. Magnien, M. Latapy, and M. Habib, Fast computation of empirically tight bounds for the diameter of massive graphs, Journal of Experimental Algorithmics, vol.13, issue.1, pp.1-19, 2009.
DOI : 10.1145/1412228.1455266
URL : https://hal.archives-ouvertes.fr/hal-01146069

A. Zoltan, A. Mann, and . Szajkó, Average-case complexity of backtrack search for coloring sparse random graphs, Journal of Computer and System