M. Abu-ata and F. F. Dragan, Metric tree-like structures in real-life networks: an empirical study, 2014.

B. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1145/174644.174650

H. Bandelt and V. Chepoi, Metric graph theory and geometry: a survey, Contemporary Mathematics, vol.453, pp.49-86, 2008.
DOI : 10.1090/conm/453/08795

H. Bandelt and H. Mulder, Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.182-208, 1986.
DOI : 10.1016/0095-8956(86)90043-2

S. Bermudo, J. Rodríguez, J. Sigarreta, and J. Vilaire, Gromov hyperbolic graphs, Discrete Mathematics, vol.313, issue.15, pp.3131575-1585, 2013.
DOI : 10.1016/j.disc.2013.04.009

A. Berry, R. Pogorelcnik, and G. Simonet, Efficient clique decomposition of a graph into its atom graph, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00678702

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

H. L. Bodlaender, Discovering Treewidth, 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp.1-16, 2005.
DOI : 10.1007/978-3-540-30577-4_1

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

J. A. Bondy and U. Murty, Graph theory with applications, 1976.
DOI : 10.1007/978-1-349-03521-2

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, 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

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

N. Cohen, D. Coudert, and A. Lancin, Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00735481

D. Coudert and G. Ducoffe, Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, 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

P. De, L. Harpe, and E. Ghys, Sur les groupes hyperboliques d'après Mikhael Gromov, Progress in Mathematics, vol.83, 1990.

M. D. Biha, B. Kaba, M. Meurs, and E. Sanjuan, Graph Decomposition Approaches for Terminology Graphs, MICAI 2007: Advances in Artificial Intelligence, pp.883-893, 2007.
DOI : 10.1007/978-3-540-76631-5_84
URL : https://hal.archives-ouvertes.fr/hal-01318619

Y. Dourisboure and C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16, pp.2008-2029, 2007.
DOI : 10.1016/j.disc.2005.12.060
URL : https://hal.archives-ouvertes.fr/hal-00307800

F. Dragan, Tree-Like Structures in Graphs: A Metric Point of View, 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.1-4, 2013.
DOI : 10.1007/978-3-642-45043-3_1

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

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

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

F. Gavril, Algorithms on clique separable graphs, Discrete Mathematics, vol.19, issue.2, pp.159-165, 1977.
DOI : 10.1016/0012-365X(77)90030-9

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, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

E. Howorka, On metric properties of certain clique graphs, Journal of Combinatorial Theory, Series B, vol.27, issue.1, pp.67-74, 1979.
DOI : 10.1016/0095-8956(79)90069-8

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

B. Kaba, N. Pinet, G. Lelandais, A. Sigayret, and A. Berry, Clustering gene expression data using graph separators, In silico biology, vol.7, issue.4, pp.433-452, 2007.

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

F. and L. Gall, Faster Algorithms for Rectangular Matrix Multiplication, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.514-523
DOI : 10.1109/FOCS.2012.80

H. Leimer, Optimal decomposition by clique separators, Discrete Mathematics, vol.113, issue.1-3, pp.99-123, 1993.
DOI : 10.1016/0012-365X(93)90510-Z
URL : http://doi.org/10.1016/0012-365x(93)90510-z

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

S. Mccullough, 2 ??? Chordal Graphs, Contributions to Operator Theory and its Applications, pp.143-192, 1988.
DOI : 10.1007/978-3-0348-9284-1_7

S. Mccullough, Minimal separators of 2-chordal graphs. Linear algebra and its applications, pp.187-199, 1993.

K. Olesen and A. Madsen, Maximal prime subgraph decomposition of Bayesian networks, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.32, issue.1, pp.21-31, 2002.
DOI : 10.1109/3477.979956

R. Paige and R. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

D. Rose, R. Tarjan, and G. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

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

M. Sys?o, Characterizations of outerplanar graphs, Discrete Mathematics, vol.26, issue.1, pp.47-53, 1979.
DOI : 10.1016/0012-365X(79)90060-8

R. Tamassia and I. Tollis, Planar grid embedding in linear time, IEEE Transactions on Circuits and Systems, vol.36, issue.9, pp.1230-1234, 1989.
DOI : 10.1109/31.34669

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.