Practical algorithms on partial k-trees with an application to domination-like problems

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

Volumn 709 LNCS, Issue , 1993, Pages 610-621

  Telle, Jan Arne ^a   Proskurowski, Andrzej ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; POLYNOMIALS;

DYNAMIC PROGRAMMING ALGORITHM; FORMAL DESCRIPTION; INPUT GRAPHS; OPTIMIZATION PROBLEMS; PARSE TREES; PARTIAL K-TREES; PROGRAMMING SOLUTIONS; TABLE UPDATES;

TREES (MATHEMATICS);

EID: 84936763747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57155-8_284     Document Type: Conference Paper

References (24)

1. K. Abrahamson and M. Fellows, Finite automata, bounded treewidth and wellquasiordering, to appear in Contemporary Mathematics (1992).
2. S. Arnborg, S. Hedetniemi and A. Proskurowski (editors) Algorithms on graphs with bounded treewidth, Special issue of Discrete Applied Mathematics.
3. S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. of Algorithms 12(1991) 308–340.
4. S. Arnborg and A. Proskurowski, Characterization and recognition of partial 3-trees, SIAM J. Alg. and Discr. Methods 7 (1986) 305–314.
5. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, Discr. Appl. Math. 23 (1989) 11–24.
6. M.W. Bern, E.L. Lawler and A.L. Wong, Linear-time computation of optimal subgraphs of decomposable graphs, J. of Algorithms 8(1987) 216–235.
7. H.L. Bodlaender, Dynamic programming on graphs with bounded treewidth, Proceedings ICALP 88, LNCS vol.317 (1988) 105–119.
8. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, to appear in Proceedings STOC'93.
9. J.A. Bondy and U.S.R. Murty, Graph theory with applications, 1976.
10. R.B. Borie, R.G. Parker and C.A. Tovey, Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursive constructed graph families, Algorithmica, 7:555–582, 1992.
11. E.J. Cockayne, B.L. Hartnell, S.T. Hedetniemi and R. Laskar, Perfect domination in graphs, manuscript (1992), to appear in Special issue of JCISS.
12. B. Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation, 85, (1990) 12–75.
13. M. Garey and D. Johnson, Computers and Intractability, Freeman, San Fransisco, 1979.
14. D. Grinstead and P. Slater, A recurrence template for several parameters in seriesparallel graphs, manuscript (1992).
15. J. van Leeuwen, Graph Algorithms, in Handbook of Theoretical Computer Science vol. A, Elsevier, Amsterdam, (1990) pg. 550.
16. J. Matoušek and R. Thomas, Algorithms finding tree-decompositions of graphs, J. of Algorithms, 12 (1991) 1–22.
17. A. Proskurowski and M. Syslo, Efficient computations in tree-like graphs, in Computing Suppl 7, (1990) 1–15.
18. N. Robertson and P.D. Seymour, Graph minors II: algorithmic aspects of tree-width, J. of Algorithms 7 (1986) 309–322.
19. D. Sanders, On linear recognition of tree-width at most four, manuscript (1992).
20. K. Takamizawa, T. Nishizeki and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs, J. ACM 29(1982) 623–641.
21. J.A. Teile, Characterization of domination-type parameters in graphs, to appear in Proceedings of 24th SouthEastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium.
22. J.A. Telle, Complexity of domination-type problems in graphs, submitted BIT.
23. J.A. Telle and A. Proskurowski, Efficient sets in partial k-trees, to appear in Domination in graphs, Special volume of Discrete Applied Mathematics.
24. T. Wimer, Linear time algorithms on k-terminal graphs. Ph.D. thesis, Clemson University, South Carolina, (1988).