A. V. Aho, I. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, pp.71-73, 1974.

A. Berry, D esarticulation d'un graphe, PhD Dissertation, LIRMM, 1998.

A. Berry, A wide-range eecient algorithm for minimal triangulation, Proceedings of SODA'99

A. Berry, J. R. Blair, and P. Heggernes, Maximum Cardinality S e a r c h for Computing Minimal Triangulations, Graph Theoretical Concepts in Computer Science -WG 2002, 2002.

A. Berry, J. Bordat, and P. Heggernes, Recognizing Weakly Triangulated Graphs by Edge Separability, Nordic Journal of Computing, vol.7, pp.164-177, 2000.
DOI : 10.1007/3-540-44985-X_13

J. R. Blair, P. Heggernes, and J. A. Telle, A practical algorithm for making lled graphs minimal, Theoretical Computer Science, vol.250, pp.124-141, 2001.

H. L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, vol.11, pp.1-21, 1993.

F. R. Chung and D. Mumford, Chordal Completions of Planar Graphs, Journal of Combinatorial Theory, Series B, vol.62, issue.1, pp.96-106, 1994.
DOI : 10.1006/jctb.1994.1056

A. Cournier, Quelques Algorithmes de D ecomposition de Graphes, PhD Dissertation, LIRMM, 1993.

E. Cuthill and J. Mckee, Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th national conference on -, pp.157-172, 1969.
DOI : 10.1145/800195.805928

E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, Graph Theoretical Concepts in Computer Science, pages 132{143, 1335.
DOI : 10.1007/BFb0024494

G. A. Dirac, On rigid circuit graphs, Abhandlungen aus dem Mathematischen Seminar der Universit??t Hamburg, vol.13, issue.1-2, pp.71-76, 1961.
DOI : 10.1007/BF02992776

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1102995572

J. A. George and J. W. Liu, Computer Solution of Large Sparse Positive Deenite Systems, 1981.

J. A. George and J. W. Liu, The Evolution of the Minimum Degree Ordering Algorithm, SIAM Review, vol.31, issue.1, pp.1-19, 1989.
DOI : 10.1137/1031001

P. Heggernes and Y. Villanger, EEcient Implementation of a Minimal Triangulation Algorithm, Algorithms -ESA 2002, pp.550-561, 2002.

D. Kratsch and J. Spinrad, Between O(nm) and O(n ), 2003.

T. Kloks, D. Kratsch, and J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension, Res. Rep, vol.1, pp.93-139
DOI : 10.1007/BFb0045387

T. Kloks, D. Kratsch, and J. Spinrad, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theoretical Computer Science, vol.175, issue.2, pp.309-335, 1997.
DOI : 10.1016/S0304-3975(96)00206-X

C. G. Lekkerkerker, J. Ch, and . Boland, Representation of a nite graph by a s e t o f i n tervals on the real line, Fund. Math, vol.51, pp.45-64, 1962.

J. W. Liu, Equivalent Sparse Matrix Reordering by Elimination Tree Rotations, SIAM Journal on Scientific and Statistical Computing, vol.9, issue.3, pp.424-444, 1988.
DOI : 10.1137/0909029

T. Ohtsuki, L. K. Cheung, and T. Fujisawa, Minimal triangulation of a graph and optimal pivoting order in a sparse matrix, Journal of Mathematical Analysis and Applications, vol.54, issue.3, pp.622-633, 1976.
DOI : 10.1016/0022-247X(76)90182-7

A. Parra and P. Scheeer, How to use the minimal separators of a graph for its chordal triangulation, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP '95), pp.123-134, 1995.
DOI : 10.1007/3-540-60084-1_68

S. Parter, The Use of Linear Graphs in Gauss Elimination, SIAM Review, vol.3, issue.2, pp.119-130, 1961.
DOI : 10.1137/1003021

B. Peyton, Minimal Orderings Revisited, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.271-294, 2001.
DOI : 10.1137/S089547989936443X

D. J. Rose, Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, vol.32, issue.3, pp.597-609, 1970.
DOI : 10.1016/0022-247X(70)90282-9

D. J. Rose, A graph-theoretic study of the numerical solution of sparse positive deenite systems of linear equations, Graph Theory and Computing, pp.183-217, 1972.

D. J. Rose, R. E. Tarjan, and G. S. 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 and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

I. Todinca, . Lip, and . Lyon, Aspects algorithmiques des triangulations minimales des graphes, 1999.

M. Yannakakis, Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981.
DOI : 10.1137/0602010