F. F. Abu-ata and . Dragan, Metric tree-like structures in real-world networks: an empirical study, Networks, vol.18, issue.1, pp.49-68, 2016.
DOI : 10.1038/30918

B. Adcock, B. D. Sullivan, and M. W. Mahoney, Tree-Like Structure in Large Social and Information Networks, 2013 IEEE 13th International Conference on Data Mining, pp.1-10, 2013.
DOI : 10.1109/ICDM.2013.77

M. Alonso, T. Brady, D. Cooper, V. Ferlini, M. Lustig et al., Notes on word hyperbolic groups, Group Theory from a Geometrical Viewpoint, pp.3-63, 1990.

M. Ben-amram, The Euler path to static level-ancestors. CoRR, abs/0909, 1030.

A. Bender and M. Farach-colton, The Level Ancestor Problem simplified, Theoretical Computer Science, vol.321, issue.1, pp.5-12, 2004.
DOI : 10.1016/j.tcs.2003.05.002

D. Borassi, P. Coudert, A. Crescenzi, and . Marino, On Computing the Hyperbolicity of Real-World Graphs, ESA, pp.215-226, 2015.
DOI : 10.1080/15326349.2013.838510
URL : https://hal.archives-ouvertes.fr/hal-01199860

P. Borassi, M. Crescenzi, and . Habib, Into the Square: On the Complexity of Some Quadratic-time Solvable Problems, Electronic Notes in Theoretical Computer Science, vol.322, pp.51-67, 2016.
DOI : 10.1016/j.entcs.2016.03.005
URL : https://hal.archives-ouvertes.fr/hal-01390131

H. Bowditch, Notes on Gromov's hyperbolicity criterion for path-metric spaces, Group Theory from a Geometrical Viewpoint, pp.64-167, 1990.

R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, volume 319 of Grundlehren der mathematischen Wissenschaften, 1999.

V. Chalopin, F. F. Chepoi, G. Dragan, A. Ducoffe, Y. Mohammed et al., Fast approximation and exact computation of negative curvature parameters of graphs, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01737445

V. Chalopin, P. Chepoi, T. Papasoglu, and . Pecatte, Cop and Robber Game and Hyperbolicity, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.1987-2007, 2014.
DOI : 10.1137/130941328
URL : https://hal.archives-ouvertes.fr/hal-01198887

F. F. Chepoi, B. Dragan, M. Estellon, Y. Habib, and . Vaxès, Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, pp.59-68, 2008.
DOI : 10.1145/1377676.1377687

F. F. Chepoi, B. Dragan, M. Estellon, Y. Habib, Y. Vaxès et al., Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs, Algorithmica, vol.52, issue.3-4, pp.3-4713, 2012.
DOI : 10.1145/1044731.1044732
URL : https://hal.archives-ouvertes.fr/hal-01194836

F. F. Chepoi, Y. Dragan, and . Vaxès, Core congestion is inherent in hyperbolic networks, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.2264-2279, 2017.
DOI : 10.1137/1.9781611974782.149
URL : https://hal.archives-ouvertes.fr/hal-01769624

B. Chepoi and . Estellon, Packing and Covering ??-Hyperbolic Spaces by Balls, In APPROX- RANDOM Lecture Notes in Computer Science, vol.11, pp.59-73, 2007.
DOI : 10.1002/jgt.3190110315
URL : http://www.lif-sud.univ-mrs.fr/~chepoi/delta_hyperbolic.pdf

D. Cohen, A. Coudert, and . Lancin, On Computing the Gromov Hyperbolicity, Journal of Experimental Algorithmics, vol.20, issue.1, pp.1-1, 2015.
DOI : 10.1016/0012-365X(85)90051-2
URL : https://hal.archives-ouvertes.fr/hal-01182890

G. Coudert and . Ducoffe, Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1601-1617, 2014.
DOI : 10.1137/140954787
URL : https://hal.archives-ouvertes.fr/hal-01070768

G. Coudert, A. Ducoffe, and . Popa, Fully polynomial FPT algorithms for some classes of bounded clique-width graphs, SODA, pp.2765-2784, 2018.
DOI : 10.1137/1.9781611975031.176
URL : https://hal.archives-ouvertes.fr/hal-01676187

M. Dasgupta, N. Karpinski, F. Mobasheri, and . Yahyanejad, Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications, Algorithmica, vol.18, issue.5, pp.772-800, 2018.
DOI : 10.1109/TNET.2010.2044514

M. Delzant and . Gromov, Courbure m??soscopique et th??orie de la toute petite simplification, Journal of Topology, vol.13, issue.(2), pp.804-836, 2008.
DOI : 10.1007/BF02760660

, J. Chalopin et al, vol.22, p.15

. Duan, Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces, Lecture Notes in Computer Science, vol.8392, pp.285-293, 2014.
DOI : 10.1007/978-3-642-54423-1_25

W. S. Edwards, I. Kennedy, and . Saniee, Fast approximation algorithms for p-centers in large ?-hyperbolic graphs, WAW, volume 10088 of Lecture Notes in Computer Science, pp.60-73, 2016.

C. Fluschnik, G. B. Komusiewicz, A. Mertzios, R. Nichterlein, N. Niedermeier et al., When Can Graph Hyperbolicity Be Computed in Linear Time?, WADS, pp.397-408, 2017.
DOI : 10.1137/1.9781611973730.111

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

, Les groupes hyperboliques d'après M. Gromov, Progress in Mathematics. Birkhäuser, vol.83, 1990.

. Gromov, Hyperbolic Groups, Essays in Group Theory, pp.75-263, 1987.
DOI : 10.1007/978-1-4613-9586-7_3

F. Hagen, Weak hyperbolicity of cube complexes and quasi-arboreal groups, Journal of Topology, vol.7, issue.2, pp.385-418, 2014.
DOI : 10.1112/jtopol/jtt027

S. Kennedy, I. Saniee, and O. Narayan, On the hyperbolicity of large-scale networks and its estimation, 2016 IEEE International Conference on Big Data (Big Data), pp.3344-3351, 2016.
DOI : 10.1109/BigData.2016.7840994

I. Narayan and . Saniee, Large-scale curvature of networks, Physical Review E, vol.6, issue.6, p.66108, 2011.
DOI : 10.1145/141800.141805

. Papasoglu, An algorithm detecting hyperbolicity, Geometric and computational perspectives on infinite groups, pp.193-200, 1994.
DOI : 10.1090/dimacs/025/10

. Polat, On infinite bridged graphs and strongly dismantlable graphs, Discrete Mathematics, vol.211, issue.1-3, pp.153-166, 2000.
DOI : 10.1016/S0012-365X(99)00142-9
URL : https://doi.org/10.1016/s0012-365x(99)00142-9

T. Shavitt and . Tankel, Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction, IEEE/ACM Transactions on Networking, vol.16, issue.1, pp.25-36, 2008.
DOI : 10.1109/TNET.2007.899021

. Soto, Quelques propriétés topologiques des graphes et applications à Internet et aux réseaux, 2011.

S. Verbeek and . Suri, Metric embedding, hyperbolic space, and social networks, Symposium on Computational Geometry, pp.501-510, 2014.
DOI : 10.1016/j.comgeo.2016.08.003
URL : https://manuscript.elsevier.com/S0925772116300712/pdf/S0925772116300712.pdf

Y. , An improved combinatorial algorithm for boolean matrix multiplication, Lecture Notes in Computer Science, vol.1, issue.9134, pp.1094-1105, 2015.