. Grph, http://www-sop.inria.fr/mascotte/software/grph, p.2012

R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, pp.47-97, 2002.
DOI : 10.1103/RevModPhys.74.47

H. Bandelt and V. Chepoi, 1-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.2, pp.323-334, 2003.
DOI : 10.1137/S0895480100380902

M. Boguna, F. Papadopoulos, and D. Krioukov, Sustaining the Internet with Hyperbolic Mapping, Nature Communications, vol.1, issue.62, 2010.

G. Brinkmann, J. H. Koolen, and V. Moulton, On the Hyperbolicity of Chordal Graphs, Annals of Combinatorics, vol.5, issue.1, 2001.
DOI : 10.1007/s00026-001-8007-7

W. Carballosa, J. M. Rodríguez, J. M. Sigarreta, and M. Villeta, Gromov hyperbolicity of line graphs, The Electronic Journal of Combinatorics, vol.18, issue.P210, pp.1-18, 2011.

W. Chen, W. Fang, G. Hu, and M. W. Mahoney, On the Hyperbolicity of Small-World and Tree-Like Random Graphs, 2012.
DOI : 10.1007/978-3-642-35261-4_31

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, Electronic Notes in Discrete Mathematics, vol.31, pp.231-234, 2008.
DOI : 10.1016/j.endm.2008.06.046

F. De-montgolfier, M. Soto, and L. Viennot, Treewidth and Hyperbolicity of the Internet, 2011 IEEE 10th International Symposium on Network Computing and Applications, pp.25-32, 2011.
DOI : 10.1109/NCA.2011.11
URL : https://hal.archives-ouvertes.fr/hal-00909736

A. Dress, K. Huber, J. Koolen, V. Moulton, and A. Spillner, Basic Phylogenetic Combinatorics, 2012.
DOI : 10.1017/CBO9781139019767

R. Duan and S. Pettie, Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths, pp.384-391, 2009.
DOI : 10.1137/1.9781611973068.43

H. Fournier, A. Ismail, and A. Vigneron, Computing the Gromov hyperbolicity of a discrete metric space, Information Processing Letters, vol.115, issue.6-8, 2012.
DOI : 10.1016/j.ipl.2015.02.002

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

P. Heggernes, D. Pim-van-'t-hof, N. Marx, Y. Misra, and . Villanger, On the parameterized complexity of finding separators with non-hereditary properties, WG, pp.332-343, 2012.

E. Jonckheere and P. Lohsoonthorn, A hyperbolic geometric approach to multipath routing, Conference on Control and Automation, 2002.

E. Jonckheere and P. Lohsoonthorn, Geometry of network security, American Control Conference, 2004.

D. Knuth, The art of computer programming Fascicle 2, chapter Generating All tuples and permutations, 2005.

J. H. Koolen and V. Moulton, Hyperbolic Bridged Graphs, European Journal of Combinatorics, vol.23, issue.6, pp.683-699, 2002.
DOI : 10.1006/eujc.2002.0591

O. Narayan and I. Saniee, The Large Scale Curvature of Networks. ArXiv e-prints, 2009.

F. Papadopoulos, D. Krioukov, M. Boguna, and A. Vahdat, Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces, 2010 Proceedings IEEE INFOCOM, pp.15-17, 2009.
DOI : 10.1109/INFCOM.2010.5462131

J. M. Rodríguez and J. M. Sigarreta, Bounds on Gromov hyperbolicity constant in graphs, Proceedings Indian Acad. Sci. (Mathematical Sciences), pp.53-65, 2012.
DOI : 10.1007/s12044-012-0060-0

Y. Shavitt and E. Shir, DIMES, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, p.506099, 2005.
DOI : 10.1145/1096536.1096546

R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2
URL : http://doi.org/10.1016/0012-365x(85)90051-2

Y. Wu and C. Zhang, Hyperbolicity and chordality of a graph, Electr. J. Comb, vol.18, issue.1, 2011.