Domino Treewidth

Journal of Algorithms

Volumn 24, Issue 1, 1997, Pages 94-123

  Bodlaender, Hans L ^a   Engelfriet, Joost ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041372866     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0854     Document Type: Article

References (18)

1. K. A. Abrahamson, R. G. Downey, and M. R. Fellows, Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic 73 (1995), 235-276.
2. S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebra Discrete Methods 8 (1987), 277-284.
3. H. L. Bodlaender, Some classes of graphs with bounded treewidth, Bull. Eur. Assoc. Theoret. Comput. Sci. 36 (1988), 116-126.
4. H. L. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11 (1993), 1-23.
5. H. L. Bodlaender, Dynamic algorithms for graphs with treewidth 2, in "Proceedings, 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93," pp. 112-124, Springer-Verlag, Berlin, 1994.
6. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996), 1305-1317.
7. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham, The parameterized complexity of sequence alignment and consensus. Theoret. Comput. Sci. 147 (1995), 31-54.
8. H. L. Bodlaender, M. R. Fellows, and M. Hallett, Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy, in "Proceedings of the 26th Annual Symposium on Theory of Computing," pp. 449-458, Assoc. Comput. Mach., New York, 1994.
9. H. L. Bodlaender and R. H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Methods 6 (1993), 181-188.
10. R. F. Cohen, S. Sairam, R. Tamassia, and J. S. Vitter, Dynamic algorithms for optimization problems in bounded tree-width graphs, in "Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization," pp. 99-112, 1993.
11. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness. III. Some structural aspects of the W hierarchy, in "Complexity Theory." (K. Ambos-Spies, S. Homer and U. Schöning, Eds.), pp. 191-226, Cambridge Univ. Press, Cambridge, UK, 1993.
12. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness. I. Basic results, SIAM J. Comput. 24 (1995), 873-921.
13. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness. II. On completeness for W[1], Theoret. Comput. Sci. 141 (1995), 109-131.
14. J. Engelfriet, L. M. Heyker, and G. Leih, Context-free graph languages of bounded degree are generated by Apex graph grammars, Acta Informat. 31 (1994), 341-378.
15. E. Horowitz and S. Sahni, "Fundamentals of Computer Algorithms," Pitman, London, 1978.
16. B. Reed, Finding approximate separators and computing tree-width quickly, in "Proceedings of the 24th Annual Symposium on Theory of Computing," pp. 221-228, ACM Press, New York, 1992.
17. N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986), 309-322.
18. D. Seese, Tree-partite graphs and the complexity of algorithms, in L. Budach, editor, "Proceedings, 1985 International Conference on Fundamentals of Computation Theory" (L. Burdach, Ed.), Lecture Notes in Computer Science, Vol. 199, pp. 412-421, Springer-Verlag, Berlin, 1985.