Fixed parameter algorithms for planar dominating set and related problems

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

Volumn 1851, Issue , 2000, Pages 97-110

  Alber, Jochen ^a   Bodlaender, Hans L ^b   Fernau, Henning ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPHIC METHODS; TREES (MATHEMATICS);

DOMINATING SETS; DOMINATION NUMBER; FIXED-PARAMETER ALGORITHMS; INDEPENDENT DOMINATING SET; INPUT GRAPHS; PLANAR DOMINATING SET; PLANE GRAPHS; TREE DECOMPOSITION;

GRAPH THEORY;

EID: 84956856287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (27)

1. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM 41:153-180, 1994.
2. D. Bienstock and C. L. Monma, On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17(1):53-76, 1988.
3. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:1305-1317, 1996.
4. H. L. Bodlaender, Treewidth: Algorithmic techniques and results. In Proceedings 22nd MFCS'97, Springer-Verlag LNCS 1295, pp. 19-36, 1997.
5. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sci. 209:1-45, 1998.
6. A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: a Survey, SIAM Monographs on Discrete Mathematics and Applications, 1999.
7. H. J. Broersma, T. Kloks, D. Kratsch, and H. Müller, Independent sets in AT-free graphs, In Proceedings ICALP'97, Springer-Verlag LNCS 1256, pp. 760-770, 1997.
8. M. S. Chang, Efficient algorithms for the domination problem on interval and circular arc graphs, SIAM J. Comput. 27:1671-1694, 1998.
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 L. K. Stewart, Dominating sets in perfect graphs, Discrete Mathematics 86, (1990), 145-164.
11. P. Crescenzi and V. Kann, A compendium of NP optimization problems. Available at http://www.nada.kth.se/theory/problemlist.html, August 1998.
12. M. Damian-Iordache and S.V. Pemmaraju, A (2 + ɛ)-approximation scheme for minimum domination on circle graphs. In Proceedings 11th ACM-SIAM SODA 2000, pp. 672-679.
13. R. G. Downey and M. R. Fellows, Parameterized computational feasibility. In P. Clote, J. Remmel (eds.): Feasible Mathematics II, pp. 219-244. Birkhäuser, 1995.
14. R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1999.
15. R. D. Dutton and R. C. Brigham, Domination in claw-free graphs, Congr. Num. 132: 69-75, 1998.
16. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
17. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater (eds.), Domination in graphs, Marcel Dekker, 1998.
18. M. A. Henning, Domination in graphs, A survey, Congr. Num. 116:139-179, 1996.
19. D. S. Hochbaum (ed.), Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997.
20. A. Kanevsky, Finding all minimum-size separating vertex sets in a graph, Networks 23: 533-541, 1993.
21. J. van Leeuwen, Graph Algorithms, In Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity Theory, North Holland, 1990.
22. H. Müller and A. Brandstädt, The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs, Theor. Comp. Sci. 53:257-265, 1987.
23. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proceedings 16th STACS, Springer-Verlag LNCS 1563, pp. 561-570, 1999.
24. C. H. Papadimitriou, Computational Complexity. Addison-Wesley, 1994.
25. R. C. Read, Prospects for graph theory algorithms. Ann. Discr. Math. 55:201-210, 1993.
26. J. A. Telle, Complexity of domination-type problems in graphs, Nordic J. Comput. 1:157-171, 1994.
27. J. A. Telle and A. Proskurowski, Algorithms for vertex partitioning problems on partial k-trees, SIAM J. Discr. Math. 10(4):529-550, 1997.