Triangulating graphs without asteroidal triples

Discrete Applied Mathematics

Volumn 64, Issue 3, 1996, Pages 281-287

  Möhring, Rolf H ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037761694     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00095-9     Document Type: Article

References (22)

1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey, BIT 25 (1985) 2-23.
2. S. Arnborg, D.G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods 8 (1987) 277-284.
3. D. Bienstock, Graph searching, path-width, tree-width and related problems (a survey), in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science 5 (American Mathematical Society, Providence, RI, 1991) 33-49.
4. H.L. Bodlaender, A tourist guide through treewidth, Tech. Rept. RUU-92-12, Rijksuniversiteit Utrecht, Utrecht (1992); also: Acta Cybernet., to appear.
5. H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson and T. Kloks, Approximating treewidth, pathwidth, and minimum elimination tree height, in: G. Schmidt and R. Berghammer, eds., Proceedings 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'91, Lecture Notes in Computer Science 570 (Springer, Berlin, 1991) 1-12.
6. H.L. Bodlaender, T. Kloks and D. Kratsch, Treewidth and pathwidth of permutation graphs, in: Proceedings of the 20th International Colloquium on Automata, Languages and Programming ICALP'93, Lecture Notes in Computer Science 700 (Springer, Berlin, 1993) 114-125.
7. H.L. Bodlaender and R.H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math. 6 (1993) 181-188.
8. D.G. Corneil, S. Olariu and L. Stewart, Asteroidal triple-free graphs, in: J. van Leeuwen, ed., Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93, Lecture Notes in Computer Science Vol.? (Springer, Berlin, 1994) 211-224.
9. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
10. M.C. Golumbic, C.L. Monma and W.T. Trotter, Tolerance graphs, Discrete Appl. Math. 9 (1984) 157-170.
11. J. Gustedt, On the pathwidth of chordal graphs, Discrete Appl. Math. 45 (1993) 233-248.
12. M. Habib and R.H. Möhring, Treewidth of cocomparability graphs and a new order-theoretic parameter, Tech. Rept. 336, Technische Universität Berlin, Berlin (1992); also: Order, to appear.
13. T. Kloks, Treewidth, Computations and Approximations, Lecture Notes in Computer Science 842 (Springer, Berlin, 1994).
14. T. Kloks, H.L. Bodlaender, H. Müller and D. Kratsch, Computing treewidth and minimum fill-in: All you need are the minimal separators, in: T. Lengauer, ed., Algorithms - ESA'93, First Annual European Symposium, Lecture Notes in Computer Science 726 (Springer, Berlin, 1993) 260-271.
15. C.G. Lekkerkerker and J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962) 45-64.
16. R.H. Mohring, Graph problems related to gate matrix layout and PLA folding, in: G. Tinhofer, E. Mayr, H. Noltemeier and M. Syslo, eds., Computational Graph Theory, Computing Supplementum 7 (Springer, Wien, 1990) 17-51.
17. R. Müller, Bounds for linear VLSI problems, Ph.D. Thesis, Fachbereich Mathematik, Technische Universität Berlin, Berlin (1993).
18. A. Parra, Triangulating bitolerance graphs, Tech. Rept. 392, Technische Universität Berlin, Berlin (1994).
19. D.J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597-609.
20. P. Scheffler, A linear algorithm for the pathwidth of trees, in: R. Bodendiek and R. Henn, eds., Topics in Combinatorics and Graph Theory (Physica-Verlag, Heidelberg, 1990) 613-620.
21. R.E. Tarjan, Decomposition by clique separators, Discrete Math. 55 (1985) 221-232.
22. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods 2 (1981) 77-79.