Hardness of r-dominating set on Graphs of Diameter (r + 1)

The dominating set problem has been extensively studied in the realm of parameterized complexity. It is one of the most common sources of reductions while proving the parameterized intractability of problems. In this paper, we look at dominating set and its generalization r-dominating set on graphs of bounded diameter in the realm of parameterized complexity. We show that dominating set remains W[2]-hard on graphs of diameter 2, while r-dominating set remains W[2]-hard on graphs of diameter r + 1. The lower bound on the diameter in our intractability results is the best possible, as r-dominating set is clearly polynomial time solvable on graphs of diameter at most r.

[1]  Saket Saurabh,et al.  Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles , 2008, Algorithmica.

[2]  Erik D. Demaine,et al.  Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.

[3]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[4]  Erik D. Demaine,et al.  The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..

[5]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

[6]  D DemaineErik,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005 .

[7]  Geevarghese Philip,et al.  On the Kernelization Complexity of Colorful Motifs , 2010, IPEC.

[8]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Fedor V. Fomin,et al.  Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs , 2010, STACS.

[11]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[12]  Dimitrios M. Thilikos,et al.  Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.

[13]  Alan A. Bertossi,et al.  Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..

[14]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[15]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[16]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.