Dominating sets in planar graphs: Branch-width and exponential speed-up

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 168-177

  Fomin, Fedor V ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Branch width; Dominating set; Fixed parameter algorithm; Planar graph; Tree width

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONFORMAL MAPPING; DYNAMIC PROGRAMMING; PARAMETER ESTIMATION; POLYNOMIALS; THEOREM PROVING;

BRANCH-WIDTH; FIXED PARAMETER ALGORITHM; GRAPH ALGORITHM; GRAPH MINOR THEORY; TREE-WIDTH;

GRAPH THEORY;

EID: 0038077573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, 33 (2002), pp. 461-493.
2. J. Alber, H. Fan, M. Fellows, and R. H. Fernau Niedermeier, Refined search tree technique for dominating set on planar graphs, in Mathematical Foundations of Computer Science-MFCS 2001, Springer, vol. 2136, Berlin, 2000, pp. 111-122.
3. J. Alber, M. R. Fellows, and R. Niedermeier, Efficient data reduction for dominating set: A linear problem kernel for the planar case, in The 8th Scandinavian Workshop on Algorithm Theory-SWAT 2002 (Turku, Finland), Springer, vol. 2368, Berlin, 2002, pp. 150-159.
4. J. Alber, H. Fernau, and R. Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, in Electronic Colloquium on Computational Complexity (ECCC), Germany, 2001.
5. M. Alekhnovich and A. A. Razborov, Satisfiability, branch-width and Tseitin tautologies, in The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), 2002, p. to appear.
6. N. Alon, P. Seymour, and R. Thomas, Planar separators, SIAM J. Discrete Math., 7 (1994), pp. 184-193.
7. H. L. Bodlaender and D. M. Thilikos, Graphs with branchwidth at most three, J. Algorithms, 32 (1999), pp. 167-194.
8. M. S. Chang, T. Kloks, and C. M. Lee, Maximum clique transversals, in The 27th International Workshop on Graph-Theoretic Concepts in Computer Science(WG 2001), Springer, Lecture Notes in Computer Science, Berlin, vol. 2204, 2001, pp. 32-43.
9. 5-minor-free graphs, in 13th Anual International Symposium on Algorithms and Computation-ISAAC 2002 (Vancouver, Canada), Springer, Lecture Notes in Computer Science, Berlin, 2002, p. to appear.
10. R. G. Downey and M. R. Fellows, Parameterized complexity, Springer-Verlag, New York, 1999.
11. F. V. Fomin and D. M. Thilikos, New upper bounds on the decomposability of planar graphs and fixed parameter algorithms, technical report, Universitat Politècnica de Catalunya, Spain, 2002.
12. J. F. Geelen, A. M. H. Gerards, and G. Whittle, Branch-width and well-quasi-ordering in matroids and graphs, J. Combin. Theory Ser. B, 84 (2002), pp. 270-290.
13. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs, Marcel Dekker Inc., New York, 1998.
14. I. V. Hicks, Branch Decompositions and their applications, PhD thesis, Rice University, 2000.
15. P. Hlineny, Branch-width, parse trees, and second-order monadic logic for matroids over finite fields. manuscript, 2002.
16. I. Kanj and L. Perković, Improved parameterized algorithms for planar dominating set, in Mathematical Foundations of Computer Science-MFCS 2002, Springer, Lecture Notes in Computer Science, Berlin, 2002, p. to appear.
17. T. Kloks and L. Cai, Parameterized tractability of some (efficient) Y-domination variants for planar graphs and t-degenerate graphs, in International Computer Symposium (ICS), Taiwan, 2000.
18. N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
19. N. Robertson and P. D. Seymour, Graph minors. XI. Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), pp. 72-106.
20. N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), pp. 323-348.
21. P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.