A linear time algorithm for finding tree-decompositions of small treewidth

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 226-234

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Graph algorithms; Graph minors; Partial k Trees; Path width; Treewidth

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PROBABILITY; TREES (MATHEMATICS);

GRAPH ALGORITHMS; GRAPH MINORS; PARTIAL K-TREES; PATH WIDTH; TREE-WIDTH;

TREES (MATHEMATICS); GRAPH THEORY;

GRAPH ALGORITHMS; GRAPH MINORS; LINEAR TIME RECOGNITION ALGORITHM; PARTIAL K TREES; PATHWIDTH; TREE DECOMPOSITIONS; TREEWIDTH;

EID: 0027242831     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167161     Document Type: Conference Paper

References (30)

1. K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. Manuscript, to appear in Comtemporary Mathematics, 1992.
2. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability -A survey. BIT, 25:2-23, 1985.
3. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-Tree. SI AM J. Alg. Disc. Meth., 8:277-284, 1987.
4. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. In H. Ehrig, H. Kreowski, and G. Rozenberg, editors, Proceedings of the Fourth Workshop on Graph Grammars and Their Applications to Computer Science, pages 70-83. Springer Verlag, Lecture Notes in Computer Science, vol. 532, 1991.
5. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308340, 1991.
6. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-Trees. Disc. Appl. Math., 23:11-24, 1989.
7. H. L. Bodlaender. Dynamic programming algorithms on graphs with bounded tree-width. In Proceedings of the 15th International Colloquium on Automata, Languages and Programming, pages 105-119. Springer Verlag, Lecture Notes in Computer Science, vol. 317, 1988.
8. H. L. Bodlaender. Improved self-reduction algorithms for graphs with bounded treewidth. In Proc. 15th Int. Workshop on Graph-Theoretic Concepts in Computer Science WG'89, pages 232-244. Springer Verlag, Lect. Notes in Computer Science, vol. 411, 1990. To appear in: Annals of Discrete Mathematics.
9. H. L. Bodlaender and T. Kloks. Better algorithms for the path width and treewidth of graphs. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, pages 544-555. Springer Verlag, Lecture Notes in Computer Science, vol. 510, 1991.
10. H. L. Bodlaender and R. H. MOhring. The pathwidth and treewidth of cographs. In Proceedings 2nd Scandinavian Workshop on Algorithm Theory, pages 301309. Springer Verlag Lecture Notes in Computer Science vol. 447, 1990. To appear in SIAM J. Discr. Math.
11. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-Time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555-582, 1992.
12. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
13. B. Courcelle and M. Mosbah. Monadic second- order evaluations on tree-decomposable graphs. In G. Schmidt and R. Berghammer, editors, Proceedings 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'91, pages 13-24. Springer Verlag, Lecture Notes in Computer Science, volume 570, 1992.
14. M. R. Fellows and M. A. Langston. Nonconstruc-Tive advances in polynomial-Time complexity. Inform. Proc. Letters, 26:157-162, 1987.
15. M. R. Fellows and M. A. Langston. Nonconstruc-Tive tools for proving polynomial-Time decidability. J. ACM, 35:727-739, 1988.
16. M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-Time algorithms. In Proceedings of the 2 lrd Annual Symposium on Theory of Computing, pages 501-512, 1989.
17. D. S. Johnson. The NP-completeness column: An ongoing guide. J. Algorithms, 8:285-303, 1987.
18. J. Lagergren. Efficient parallel algorithms for tree- decomposition and related problems. In Proceedings of the 3lrd Annual Symposium on Foundations of Computer Science, pages 173-182, 1990.
19. J. Lagergren and S. Arnborg. Finding minimal forbidden minors using a finite congruence. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, pages 533-543. Springer Verlag, Lecture Notes in Computer Science, vol. 510, 1991.
20. J. Matoussk and R. Thomas. Algorithms finding tree- decompositions of graphs. J. Algorithms, 12:1-22, 1991.
21. B. Reed. Finding approximate separators and computing tree-width quickly. In Proceedings of the 24th Annual Symposium on Theory of Computing, pages 221-228, 1992.
22. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309322, 1986.
23. N. Robertson and R D. Seymour. Graph minors. V. Excluding a planar graph. J. Comb. Theory Series B, 41:92-114, 1986.
24. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. Manuscript, 1986.
25. N. Robertson and P. D. Seymour. Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory Series B, 48:227-254, 1990.
26. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Series B, 52:153-190, 1991.
27. D. P. Sanders. On linear recognition of tree-width at most four. Manuscript, 1992.
28. P. Scheffler. Die Baumweite von Graphen als ein Mafi fur die Kompliziertheit algorithmischer Prob- leme. PhD thesis, Akademie der Wissenschaften der DDR, Berlin, 1989.
29. J. van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, pages 527-631, Amsterdam, 1990. North Holland Publ. Comp.
30. T. V. Wimer. Linear Algorithms on k-Terminal Graphs. PhD thesis, Dept. of Computer Science, Clemson University, 1987.