Efficient implementation of a minimal triangulation algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 550-562

  Heggernes, Pinar ^a   Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TRIANGULATION;

EFFICIENT IMPLEMENTATION; MINIMAL TRIANGULATIONS; RUN-TIME TESTS; TIME BOUND; TIME COMPLEXITY; TREE DECOMPOSITION;

TREES (MATHEMATICS);

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

EID: 84938097367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_49     Document Type: Conference Paper

References (15)

1. A. Berry. A wide-range efficient algorithm for minimal triangulation. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999. 550, 551, 552, 557
2. A. Berry, J-P. Bordat, and P. Heggernes. Recognizing weakly triangulated graphs by edge separability. Nordic Journal of Computing, 7:164-177, 2000. 552
3. J. R. S. Blair, P. Heggernes, and J. A. Telle. Making an arbitrary filled graph minimal by removing fill edges. In R. Karlsson and A. Lingas, editors, Algorithm Theory-SWAT ‘96, pages 173-184. Springer Verlag, 1996. Lecture Notes in Computer Science 1097. 550
4. J. R. S. Blair, P. Heggernes, and J. A. Telle. A practical algorithm for making filled graphs minimal. Theoretical Computer Science, 250:125-141, 2001. 550
5. J. R. S. Blair and B. W. Peyton. An introduction to chordal graphs and clique trees. In J. A. George, J. R. Gilbert, and J. W. H. Liu, editors, Graph Theory and Sparse Matrix Computations, pages 1-30. Springer Verlag, 1993. IMA Volumes in Mathematics and its Applications, Vol. 56. 552
6. H.L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-21, 1993. 552
7. E. Dahlhaus. Minimal elimination ordering inside a given chordal graph. In R. H. Mohring, editor, Graph Theoretical Concepts in Computer Science-WG ‘97, pages 132-143. Springer Verlag, 1997. Lecture Notes in Computer Science 1335. 550
8. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory Ser. B, 16:47-56, 1974. 552
9. C-W. Ho and R. C. T. Lee. Counting clique trees and computing perfect elimination schemes in parallel. Inform. Process. Lett., 31:61-68, 1989. 553
10. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science, 175:309-335, 1997. 552
11. C. G. Lekkerkerker and J. C. Boland. Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae, 51:45-64, 1962. 551
12. T. Ohtsuki. A fast algorithm for finding an optimal ordering in the vertex elimination on a graph. SIAM J. Comput., 5:133-145, 1976. 550
13. A. Parra. Structural and algorithmic aspects of chordal graph embeddings.PhD thesis, Technische Universitat Berlin, 1996. 552
14. B. W. Peyton. Minimal orderings revisited. SIAM J. Matrix Anal. Appl., 23(1):271-294, 2001. 550
15. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5:266-283, 1976. 550, 559