1. Amestoy, P., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886–905 (1996)
2. Berry, A.: Désarticulation d’un graphe. PhD Dissertation, LIRMM, Montpellier (December 1998)
3. Lecture Notes in Computer Science;A. Berry,2002
4. Berry, A., Bordat, J.-P., Heggernes, P., Simonet, G., Villanger, Y.: A widerange algorithm for minimal triangulation from an arbitrary ordering. Reports in Informatics 243, University of Bergen, Norway, 2003, and Research Report 02-200, LIRRM, Montpellier, France. Submitted to Journal of Algorithms (November 2002)
5. Blair, J.R.S., Heggernes, P., Telle, J.A.: A practical algorithm for making filled graphs minimal. Theoretical Computer Science 250, 124–141 (2001)