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

A. Berry and J. Bordat, Decomposition by clique minimal separators, 1999.

A. Berry, A. Brandstädt, V. Giakoumakis, and M. F. , Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds, Discrete Applied Mathematics, vol.184, pp.50-61, 2015.
DOI : 10.1016/j.dam.2014.11.018
URL : https://hal.archives-ouvertes.fr/hal-01323853

A. Berry, R. Pogorelcnik, and A. Sigayret, Vertical decomposition of a lattice using clique separators, Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, pp.15-29, 2011.

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, p.197, 2010.
DOI : 10.3390/a3020197
URL : https://hal.archives-ouvertes.fr/lirmm-00485851

A. Berry, R. Pogorelcnik, and G. Simonet, Organizing the atoms of the clique separator decomposition into an atom tree, Discrete Applied Mathematics, vol.177, pp.1-13, 2014.
DOI : 10.1016/j.dam.2014.05.030
URL : https://hal.archives-ouvertes.fr/hal-01375915

A. Berry and A. Wagler, Triangulation and Clique Separator Decomposition of Claw-Free Graphs, Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, pp.7-21, 2012.
DOI : 10.1007/978-3-642-34611-8_5

H. Bodlaender and A. Koster, Safe separators for treewidth, Discrete Mathematics, vol.306, issue.3, pp.337-350, 2006.
DOI : 10.1016/j.disc.2005.12.017
URL : http://doi.org/10.1016/j.disc.2005.12.017

J. Bondy and U. Murty, Graph theory, 2008.
DOI : 10.1007/978-1-84628-970-5

M. Borassi, P. Crescenzi, and M. Habib, Into the square -on the complexity of quadratic-time solvable problems. arXiv preprint arXiv, pp.1407-4972, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01390131

A. Brandstädt and C. Hò, On clique separators, nearly chordal graphs, and the maximum weight stable set problem, Integer Programming and Combinatorial Optimization, pp.265-275, 2005.

A. Brandstädt and R. Mosca, Weighted efficient domination for P 6 -free graphs in polynomial time, 2015.

M. Changat and J. Mathew, On triangle path convexity in graphs, Discrete Mathematics, vol.206, issue.1-3, pp.91-95, 1999.
DOI : 10.1016/S0012-365X(98)00394-X

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

E. Dahlhaus, Minimal elimination of planar graphs, Algorithm Theory -SWAT '98, 6th Scandinavian Workshop on Algorithm Theory Proceedings, pp.210-221, 1998.
DOI : 10.1007/BFb0054369

E. Dahlhaus, Minimal elimination ordering for graphs of bounded degree, Discrete Applied Mathematics, vol.116, issue.1-2, pp.127-143, 2002.
DOI : 10.1016/S0166-218X(00)00331-0

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. Fomin, D. Lokshtanov, M. Pilipczuk, S. Saurabh, and W. Wrochna, Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1379.
DOI : 10.1137/1.9781611974782.92

F. Gavril, Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph, SIAM Journal on Computing, vol.1, issue.2, pp.180-187, 1972.
DOI : 10.1137/0201013

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. Golumbic and R. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.8-22, 1985.
DOI : 10.1016/0095-8956(85)90088-7

P. Heggernes, Minimal triangulations of graphs: A survey, Discrete Mathematics, vol.306, issue.3, pp.297-317, 2006.
DOI : 10.1016/j.disc.2005.12.003

P. Heggernes, J. Telle, and Y. Villanger, Computing minimal triangulations in time O(n ? log n) = o(n 2.376 ), Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.907-916, 2005.

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

D. Kratsch and J. Spinrad, ), SIAM Journal on Computing, vol.36, issue.2, pp.310-325, 2006.
DOI : 10.1137/S0097539704441435

D. Kratsch and J. Spinrad, Minimal fill in O(n 2.69 ) time. Discrete mathematics, pp.366-371, 2006.

F. and L. Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.296-303, 2014.
DOI : 10.1145/2608628.2608664

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

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

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

V. , V. Williams, and R. Williams, Subcubic Equivalences between Path, Matrix and Triangle Problems, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp.645-654, 2010.
DOI : 10.1109/FOCS.2010.67
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.3568

H. Yaghi and H. Krim, Probabilistic graph matching by canonical decomposition, 2008 15th IEEE International Conference on Image Processing, pp.2368-2371, 2008.
DOI : 10.1109/ICIP.2008.4712268