A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms

Volumn 58, Issue 1, 2006, Pages 33-66

  Berry, Anne ^a   Bordat, Jean Paul ^b   Heggernes, Pinar ^c   Simonet, Geneviève ^b   Villanger, Yngve ^c  

^a CNRS   (France)

^b LIRMM   (France)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE DETECTION; GRAPH THEORY; PROBLEM SOLVING; TRIANGULATION;

ALGORITHM - LB-TRIANG; ARBITRARY ORDERING; CHORDAL GRAPHS; TRIANGULATION TECHNIQUES;

ALGORITHMS;

EID: 28444487909     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.07.001     Document Type: Article

References (31)

1. A.V. Aho, I.E. Hopcroft, and J.D. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley p. 71, ex. 2.12
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis On the desirability of acyclic database systems J. Assoc. Comput. Mach. 30 1983 479 513
3. A. Berry, Désarticulation d'un graphe, PhD dissertation, LIRMM, Montpellier, December 1998
4. A. Berry A wide-range efficient algorithm for minimal triangulation Proceedings of SODA'99 1999 S860 S861
5. A. Berry, J.R.S. Blair, P. Heggernes, and B. Peyton Maximum Cardinality Search for Computing Minimal Triangulations of Graphs Algorithmica 39 4 2004 287 298
6. A. Berry, J.-P. Bordat, and P. Heggernes Recognizing weakly triangulated graphs by edge separability Nordic J. Comput. 7 2000 164 177
7. J.R.S. Blair, P. Heggernes, and J.A. Telle A practical algorithm for making filled graphs minimal Theoret. Comput. Sci. 250 2001 124 141
8. H.L. Bodlaender A tourist guide through treewidth Acta Cybernetica 11 1993 1 21
9. F.R.K. Chung, and D. Mumford Chordal completions of planar graphs J. Combin. Theory 31 1994 96 106
10. A. Cournier, Quelques Algorithmes de Décomposition de Graphes, PhD dissertation, LIRMM, Montpellier, France, February 1993
11. E. Dahlhaus Minimal elimination ordering inside a given chordal graph Graph Theoretical Concepts in Computer Science - Proceedings of WG '97 Lecture Notes in Comput. Sci. vol. 1335 1997 Springer-Verlag 132 143
12. G.A. Dirac On rigid circuit graphs Abh. Math. Sem. Univ. Hamburg 25 1961 71 76
13. D.R. Fulkerson, and O.A. Gross Incidence matrices and interval graphs Pacific J. Math. 15 1965 835 855
14. J.A. George, and J.W.H. Liu Computer Solution of Large Sparse Positive Definite Systems 1981 Prentice-Hall Englewood Cliffs, NJ
15. P. Heggernes, and Y. Villanger Efficient implementation of a minimal triangulation algorithm Algorithms - Proceedings of ESA 2002 Lecture Notes in Comput. Sci. vol. 2461 2002 Springer-Verlag 550 561
16. D. Hudson, S. Nettles, and T. Warnow Obtaining highly accurate topology estimates of evolutionary trees from very short sequences Proceedings of RECOMB'99 1999 198 207
17. D. Kratsch, and J. Spinrad Between O (n m ) and O (n α ) Proceedings of SODA 2003 2003 709 716
18. T. Kloks, D. Kratsch, J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension, Res. Rep. 93-46, Eindhoven University of Technology, 1993
19. T. Kloks, D. Kratsch, and J. Spinrad On treewidth and minimum fill-in of asteroidal triple-free graphs Theoret. Comput. Sci. 175 1997 309 335
20. S.L. Lauritzen, and D.J. Spiegelhalter Local computations with probabilities on graphical structures and their applications to expert systems J. R. Stat. Soc. Ser. B 50 1988 157 224
21. C.G. Lekkerkerker, and J.Ch. Boland Representation of a finite graph by a set of intervals on the real line Fund. Math. 51 1962 45 64
22. T. Ohtsuki, L.K. Cheung, and T. Fujisawa Minimal triangulation of a graph and optimal pivoting order in a sparse matrix J. Math. Anal. Appl. 54 1976 622 633
23. A. Parra, and P. Scheffler 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) Lecture Notes in Comput. Sci. vol. 944 1995 123 134
24. S. Parter The use of linear graphs in Gauss elimination SIAM Review 3 1961 119 130
25. B. Peyton Minimal orderings revisited SIAM J. Matrix Anal. Appl. 23 2001 271 294
26. D.J. Rose Triangulated graphs and the elimination process J. Math. Anal. Appl. 32 1970 597 609
27. D.J. Rose A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations R.C. Read Graph Theory and Computing 1972 Academic Press 183 217
28. D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 1976 266 283
29. R.E. Tarjan, and M. Yannakakis Simple linear-time algorithms to test chordality of graphs, est acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM J. Comput. 13 1984 566 579
30. I. Todinca, Aspects algorithmiques des triangulations minimales des graphes, PhD thesis, LIP, ENS Lyon, 1999
31. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebr. Discrete Methods 2 1981 77 79