A. B. Adcock, B. D. Sullivan, O. R. Hernandez, and M. W. Mahoney, Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity, 9th International Workshop on OpenMP (IWOMP), pp.71-83, 2013.
DOI : 10.1007/978-3-642-40698-0_6

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

A. Berry, R. Pogorelcnik, and G. Simonet, An Introduction to Clique Minimal Separator Decomposition, Algorithms, vol.3, issue.2, pp.197-215, 2010.
DOI : 10.3390/a3020197
URL : https://hal.archives-ouvertes.fr/lirmm-00485851

M. Boguñá, F. Papadopoulos, and D. V. Krioukov, Sustaining the Internet with hyperbolic mapping, Nature Communications, vol.16, issue.6, pp.1-18, 2010.
DOI : 10.1038/ncomms1063

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

J. Chakerian and S. Holmes, distory: Distance between phylogenetic histories, 2010.

J. Chakerian and S. Holmes, Computational Tools for Evaluating Phylogenetic and Hierarchical Clustering Trees, Journal of Computational and Graphical Statistics, vol.14, issue.2, pp.581-599, 2012.
DOI : 10.1080/10618600.2012.640901
URL : http://arxiv.org/abs/1006.1015

P. Charbit, F. De-montgolfier, and M. Raffinot, Linear Time Split Decomposition Revisited, SIAM Journal on Discrete Mathematics, vol.26, issue.2, pp.499-514, 2012.
DOI : 10.1137/10080052X
URL : https://hal.archives-ouvertes.fr/hal-00921774

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

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

E. Cho, S. A. Myers, and J. Leskovec, Friendship and mobility, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.1082-1090, 2011.
DOI : 10.1145/2020408.2020579

N. Cohen, D. Coudert, G. Ducoffe, and A. Lancin, Applying clique-decomposition for computing Gromov hyperbolicity, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00989024

]. D. Coudert, Gromov hyperbolicity of graphs: C source code, 2014.

D. Coudert and G. 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

W. H. Cunningham, Decomposition of Directed Graphs, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.2, pp.214-228, 1982.
DOI : 10.1137/0603021

W. H. Cunningham and J. Edmonds, A combinatorial decomposition theory, Journal canadien de math??matiques, vol.32, issue.3, pp.734-765, 1980.
DOI : 10.4153/CJM-1980-057-7

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, 2011.
DOI : 10.1017/CBO9781139019767

R. Duan, Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces, 11th Latin American Theoretical Informatics Symposium (LATIN), pp.285-293, 2014.
DOI : 10.1007/978-3-642-54423-1_25

R. Duan and S. Pettie, Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths, 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 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, pp.6-8576, 2015.
DOI : 10.1016/j.ipl.2015.02.002

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

M. Gromov, Hyperbolic Groups, of Mathematical Sciences Research Institute Publications, pp.75-263, 1987.
DOI : 10.1007/978-1-4613-9586-7_3

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

L. Hogie, Grph, the high performance graph library for Java (Version 1.4.17) The Grph Development Team, 2014.

E. A. Jonckheere and P. Lohsoonthorn, Geometry of network security, American Control Conference, pp.976-981, 2004.

W. S. Kennedy, O. Narayan, and I. Saniee, On the hyperbolicity of large-scale networks, 2013.

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
URL : http://doi.org/10.1006/eujc.2002.0591

D. V. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá, Hyperbolic geometry of complex networks, Physical Review E, vol.82, issue.3, p.36106, 2010.
DOI : 10.1103/PhysRevE.82.036106

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution, ACM Transactions on Knowledge Discovery from Data, vol.1, issue.1, pp.1-41, 2007.
DOI : 10.1145/1217299.1217301

D. Lokshtanov, Finding the longest isometric cycle in a graph, Discrete Applied Mathematics, vol.157, issue.12, pp.2670-2674, 2009.
DOI : 10.1016/j.dam.2008.08.008

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, pp.10-11, 2009.
DOI : 10.1145/1412228.1455266
URL : https://hal.archives-ouvertes.fr/hal-01146069

O. Narayan and I. Saniee, Large-scale curvature of networks, Physical Review E, vol.84, issue.6, p.66108, 2011.
DOI : 10.1103/PhysRevE.84.066108

O. Narayan, I. Saniee, and G. H. Tucci, Lack of Hyperbolicity in Asymptotic Erd??s???Renyi Sparse Random Graphs, Internet Mathematics, vol.11, issue.3, pp.277-288, 2015.
DOI : 10.1080/15427951.2014.1002640

F. Papadopoulos, D. V. Krioukov, M. Boguñá, and A. Vahdat, Greedy forwarding in scalefree networks embedded in hyperbolic metric spaces, ACM SIGMETRICS Performance Evaluation Review, vol.37, issue.2, pp.15-17, 2009.

R. Team, R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, 2014.

V. Ramasubramanian, D. Malkhi, F. Kuhn, M. Balakrishnan, A. Gupta et al., On the treeness of internet latency and bandwidth, Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, SIGMETRICS '09, pp.61-72, 2009.
DOI : 10.1145/1555349.1555357

Y. Shang, Lack of Gromov-hyperbolicity in colored random networks, PanAmerican Mathematical Journal, vol.21, issue.1, pp.27-36, 2011.

Y. Shavitt and E. Shir, DIMES, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, pp.71-74, 2005.
DOI : 10.1145/1096536.1096546

M. A. Soto-gómez, Quelques propriétés topologiques des graphes et applicationsàapplicationsà internet et aux réseaux, 2011.

W. A. Stein, The Sage Development Team, Sage Mathematics Software (Version, vol.6, issue.1, 2014.

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

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, The Electronic Journal of Combinatorics, vol.18, issue.1, p.43, 2011.