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

SIAM Journal on Computing

Volumn 36, Issue 2, 2006, Pages 281-309

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

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

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

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; PARAMETERIZATION; PROBLEM SOLVING; SET THEORY;

BRANCH WIDTH; DOMINATING SETS; FIXED-PARAMETER ALGORITHMS; PLANAR GRAPHS; TREE WIDTH;

TREES (MATHEMATICS);

EID: 34247184732     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702419649     Document Type: Review

References (39)

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. R. FELLOWS, H. FERNAU, R. NIEDERMEIER, F. A. ROSAMOND, AND U. STEGE, Refined search tree technique for dominating set on planar graphs, in Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Comput. Sci. 2136, Springer, Berlin, 2001, pp. 111-122.
3. J. ALBER, M. R. FELLOWS, AND R. NIEDERMEIER, Polynomial-time data reduction for dominating set, J. ACM, 51 (2004), pp. 363-384.
4. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Parameterized complexity: Exponential speed-up for planar graph problems, J. Algorithms, 52 (2004), pp. 26-56.
5. M. ALEKHNOVICH AND A. A. RAZBOROV, Satisfiability, branch-width and Tseitin tautologies, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), IEEE Computer Society, 2002, pp. 593-603.
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 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), Lecture Notes in Comput. Sci. 2204, Springer, Berlin, 2001, pp. 32-43.
9. J. CHEN, H. FERNAU, I. A. KANJ, AND G. XIA, Parametric duality and kernelization: Lower bounds and upper bounds on kernel size, in Proceeding of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2005), Lecture Notes in Comput. Sci. 3404, Springer, Berlin, 2005, pp. 269-280.
10. W. COOK AND P. D. SEYMOUR, An algorithm for the ring-routing problem, Bellcore technical memorandum, Bellcore, Morristown, NJ, 1993.
11. W. COOK AND P. D. SEYMOUR, Tour merging via branch-decomposition, INFORMS J. Comput., 15 (2003), pp. 233-248.
12. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, J. ACM, 52 (2005), pp. 866-893.
13. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs, ACM Trans. Algorithms, 1 (2005), pp. 33-47.
14. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Bidimensional parameters and local treewidth, SIAM J. Discrete Math., 18 (2004), pp. 501-511.
15. E. D. DEMAINE AND M. T. HAJIAGHAYI, Equivalence of local treewidth and linear local treewidth and its algorithmic applications, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), 2004, pp. 833-842.
16. E. D. DEMAJNE AND M. T. HAJIAGHAYI, Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimeneionality, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 2005, pp. 682-689.
17. E. D. DEMAINE, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors, Algorithmica, 4 (2005), pp. 245-267.
18. E. D. DEMAINE, M. T. HAJIAGHAYI, AND D. M. THILIKOS, The bidimensional theory of boundedgenus graphs, in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Lecture Notes in Comput. Sci. 3153, Springer, Berlin, 2004, pp. 191-203.
19. F. DORN, E. PENNINKX, H. BODLAENDER, AND F. V. FOMIN, Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions, in Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), Lecture Notes in Comput. Sci. 3669, Springer, Berlin, 2005, pp. 95-106.
20. F. DORN AND J. A. TELLE, Two birds with one stone: The best of branchwidth and treewidth with one algorithm, in Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006), Lecture Notes in Comput. Sci. 3887, Springer, Berlin, 2006, pp. 386-397.
21. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer, New York, 1999.
22. H. FERNAU AND D. W. JUEDES, A geometric approach to parameterized algorithms for domination problems on planar graphs, in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Lecture Notes in Comput. Sci. 3153, Springer, Berlin, 2004, pp. 488-499.
23. M. R. FELLOWS, Parameterized complexity: The main ideas and some research frontiers, in Proceedings of the 12th Annual International Symposium on Algorithms and Computation (ISAAC 2001), Lecture Notes in Comput. Sci. 2223, Springer, Berlin, 2001, pp. 291-307.
24. J. FLUM AND M. GROHE, The parameterized complexity of counting problems, SIAM J. Comput., 33 (2004), pp. 892-922.
25. F. V. FOMIN AND D. M. THILIKOS, Dominating sets in planar graphs: Branch-width and exponential speed-up, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 168-177.
26. F. V. FOMIN AND D. M. THILIKOS, Dominating sets and local treewidth, in Proceedings of the llth Annual European Symposium on Algorithms (ESA 2003), Lecture Notes in Comput. Sci. 2832, Springer, Berlin, 2003, pp. 221-229.
27. F. V. FOMIN AND D. M. THILIKOS, Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Lecture Notes in Comput. Sci. 3142, Springer, Berlin, 2004, pp. 581-592.
28. F. V. FOMIN AND D. M. THILIKOS, New upper bounds on the decomposability of planar graphs, J, Graph Theory, 51 (2006), pp. 53-81.
29. 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.
30. 3) time, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Comput. Sci. 3580, Springer, Berlin, 2005, pp. 373-384.
31. G. GUTIN, T. KLOKS, C. M. LEE, AND A. YEO, Kernels in planar digraphs, J. Comput. System Sci., 71 (2005), pp. 174-184.
32. T. W. HAYNES, S. T. HEDETNIEMI, AND P. J. SLATER, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
33. I. V. HICKS, Planar branch decompositions. I. The ratcatcher, INFORMS J. Comput., 17 (2005), pp. 402-412.
34. P. HLINĚNÝ, Branch-width, parse trees, and monadic second-order logic for matroids over finite fields, in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STAGS 2003), Lecture Notes in Comput. Sci. 2607, Springer, Berlin, 2003, pp. 319-330.
35. I. KANJ AND L. PERKOVIĆ, Improved parameterized algorithms for planar dominating set, in Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Lecture Notes in Comput. Sci. 2420, Springer, Berlin, 2002, pp. 399-410.
36. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
37. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. XL Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), pp. 72-106.
38. N. ROBERTSON, P. D. SEYMOUR, AND R. THOMAS, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), pp. 323-348.
39. P. D. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.