Characterizations and algorithmic applications of chordal graph embeddings

Discrete Applied Mathematics

Volumn 79, Issue 1-3, 1997, Pages 171-188

  Parra, Andreas ^a   Scheffler, Petra ^b  

^a Mannesmann Autocom   (Germany)

^b UNIVERSITY OF APPLIED SCIENCES STRALSUND   (Germany)

Author keywords

Asteroidal triple; Bandwidth; Interval graph; Rank; Separator; Treewidth; Triangulation

Indexed keywords

EID: 0000865792     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00041-3     Document Type: Article

References (38)

1. S. Arnborg, D.G. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic and Discrete Methods 8 (1987) 277-284.
2. S. Arnborg, J. Lagergren, D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991) 308-340.
3. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, Proc. 25th Annual ACM Symp. on Theory of Computing (STOC'93), 1993, pp. 226-234.
4. H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11 (1993) 1-23.
5. H.L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, Zs. Tuza, Rankings of graphs, Proc. 20th Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG'94), Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1995, pp. 292-304.
6. H.L. Bodlaender, M.R. Fellows, M.T. Hallet, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, Proc. 26th Annual ACM Symp. on Theory of Computing (STOC'94), 1994, pp. 449-458.
7. H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson, T. Kloks, Approximating treewidth, pathwidth and minimum elimination tree height, J. Algorithms 18 (1995) 238-255.
8. H.L. Bodlaender, T. Kloks, D. Kratsch, Treewidth and pathwidth of permutation graphs, SIAM J. Discrete Math. 8 (1995) 606-616.
9. H.L. Bodlaender, R.H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math. 6 (1993) 181-188.
10. P.Z. Chinn, J. Chvátalová, A.K. Dewdney, N.E. Gibbs, The bandwidth problem for graphs and matrices - a survey, J. Graph Theory 6 (1982) 223-254.
11. D.G. Corneil, S. Olariu, L. Stewart, The linear structure of graphs: Asteroidal triple-free graphs, Proc. 19th Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), Lecture Notes in Computer Science, vol. 790, Springer, Berlin, 1994, pp. 211-224.
12. D.G. Corneil, Y. Perl, L. Stewart, Cographs: recognition, applications and algorithms, Congr. Numer. 43 (1984) 249-258.
13. P. de la Torre, R. Greenlaw, A.A. Schäffer, Optimal ranking of trees in polynomial time, Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'93), 1993, pp. 138-144.
14. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
15. R. Faudree, E. Flandrin, Z. Ryjáček, Claw-free graphs - a survey, Technical Report č. 61, Západočeská Univerzita, Plzeň, Czech Republic, 1994.
16. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Sci. Hungary 18 (1967) 25-66.
17. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
18. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
19. M.C. Golumbic, H. Kaplan, R. Shamir, On the complexity of DNA physical mapping, Adv. Appl. Math. 15 (1994) 251-261.
20. E.M. Gurari, I.H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem, J. Algorithms 5 (1984) 531-546.
21. A.V. lyer, H.D. Ratliff, G. Vijayan, Optimal node ranking of trees, Inform. Process. Lett. 28 (1988) 225-229.
22. H. Kaplan, R. Shamir, R.E. Tarjan, Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping, Proc. 35th Annual IEEE Symp. on Foundations of Computer Science (FOCS'94), 1994, pp. 780-791.
23. T. Kloks, Treewidth - Computations and Approximations. Lecture Notes in Computer Science, vol. 842, Springer, Berlin, 1994.
24. T. Kloks, H.L. Bodlaender, H. Müller, D. Kratsch, Computing treewidth and minimum fill-in: all you need are the minimal separators, Proc. 1st Annual European Symp. on Algorithms (ESA'93), Lecture Notes in Computer Science, vol. 726, Springer, Berlin, 1993, pp. 260-271; Erratum: Proc. ESA'94, Lecture Notes in Computer Science, vol. 855, Springer, Berlin, 1994, p. 508.
25. T. Kloks, D. Kratsch, Finding all minimal separators of a graph, Proc. 11th Annual Symp. on Theoretical Aspects of Computer Science (STACS'94), Lecture Notes in Computer Science, vol. 775, Springer, Berlin, 1994, pp. 759-768.
26. T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, Proc. Third Annual European Symp. on Algorithms (ESA'95), Lecture Notes in Computer Science, vol. 979, Springer, Berlin, 1995, pp. 437-447.
27. T. Kloks, D. Kratsch, J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension. Technical Report 93/46, Eindhoven University of Technology, The Netherlands, 1993.
28. C.E. Leiserson, Area efficient graph layouts for VLSI, Proc. 21st Annual IEEE Symp. on Foundations of Computer Science (FOCS'80), 1980, pp. 270-281.
29. C.G. Lekkerkerker, J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962) 45-64.
30. R.H. Möhring, Graph problems related to gate matrix layout and PLA folding, in: G. Tinhofer, E. Mayr, H. Noltemeier, M. Syslo, (Eds.), Computational Graph Theory, Computing Supplementum 7, Springer, Wien, 1990, pp. 17-51.
31. R.H. Möhring, Triangulating graphs without asteroidal triples, Discrete Appl. Math. 64 (1996) 281-287.
32. C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976) 263-270.
33. A. Parra, P. Scheffler, How to use the minimal separators of a graph for its chordal triangulation, Proc. 22nd Internat. Colloquium on Automata, Languages and Programming (ICALP'95), Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 123-134.
34. A. Pothen, The complexity of optimal elimination trees, Technical Report CS-88-13, Pennsylvania State University, 1988.
35. F.S. Roberts, Indifference graphs, in: F. Harary (Ed.), Proof Techniques in Graph Theory, Academic Press, New York, 1969, pp. 139-146.
36. N. Robertson, P.D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986) 309-322.
37. P. Scheffler, Node ranking and searching on graphs, Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization, Enschede, 1993, pp. 159-162.
38. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic and Discrete Methods 2 (1981) 77-79.