Improved tree decomposition based algorithms for domination-like problems

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

Volumn 2286, Issue , 2002, Pages 613-627

  Alber, Jochen ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

BEST-KNOWN ALGORITHMS; DOMINATING SETS; GAIN IMPROVEMENT; MONOTONICITY; RUNNING TIME; RUNNING-IN; TREE DECOMPOSITION;

DYNAMIC PROGRAMMING;

ALGORITHMS; TREES;

EID: 84937405099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_52     Document Type: Conference Paper

References (21)

1. J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In Proceedings 7th SWAT 2000, Springer-Verlag LNCS 1851, pp. 97–110, 2000.
2. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. In Proceedings 28th ICALP 2001, Springer-Verlag LNCS 2076, pp. 261–272, 2001.
3. J. Alber, F. Dorn, and R. Niedermeier. Experiments on optimally solving parameterized problems on planar graphs. Manuscript, December 2001.
4. B. Aspvall, A. Proskurowski, and J. A. Telle. Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27: 382–394, 2000.
5. D. Bienstock and C. L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17: 53–76, 1988.
6. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25: 1305–1317, 1996.
7. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proceedings 22nd MFCS’97, Springer-Verlag LNCS 1295, pp. 19–36, 1997.
8. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 1999.
9. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. In Proceedings 25th WG, Springer-Verlag LNCS 1665, pp. 313–324, 1999.
10. D. G. Corneil and J. M. Keil. A dynamic programming approach to the dominating set problem on k-trees. SIAM J. Alg. Disc. Meth., 8: 535–543, 1987.
11. R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer-Verlag, 1999.
12. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Monographs and textbooks in Pure and Applied Mathematics Vol. 208, Marcel Dekker, 1998.
13. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater (eds.). Domination in Graphs; Advanced Topics. Monographs and textbooks in Pure and Applied Mathematics Vol. 209, Marcel Dekker, 1998.
14. T. Kloks. Treewidth. Computations and Approximations. Springer-Verlag LNCS 842, 1994.
15. A. M. C. A. Koster, H. L. Bodlaender, and S. P. M. Hoesel. Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8, Elsevier Science Publishers, 2001.
16. D. Kratsch. Algorithms. Chapter 8 in [13].
17. K. Mehlhorn and S. Näher. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England, 1999.
18. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proc. 16th STACS’99, Springer-Verlag LNCS 1563, pp. 561–570, 1999.
19. J. A. Telle. Complexity of domination-type problems in graphs. Nordic J. Comput. 1: 157–171, 1994.
20. J. A. Telle and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. In Proceedings 3rd WADS’93, Springer-Verlag LNCS 709, pp. 610–621, 1993.
21. J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discr. Math. 10(4): 529–550, 1997.