Parameterized Complexity for Domination Problems on Degenerate Graphs

Domination problems are one of the classical types of problems in computer science. These problems are considered in many different versions and on different classes of graphs. We explore the boundary between fixed-parameter tractable and W-hard problems on sparse graphs. More precisely, we expand the list of domination problems which are fixed-parameter tractable(FPT) for degenerate graphs by proving that Connected k -Dominating set and k -Dominating threshold set are FPT. From the other side we prove that there are domination problems which are difficult (W[1] or W[2]-hard) for this graph class. The Partial k -dominating set and (k ,r ) -Center for r *** 2 are examples of such problems. It is also remarked that domination problems become difficult for graphs of bounded average degree.

[1]  L. Cai,et al.  Parameterized tractability of some (efficient) Y-domination variants for planar graphs and t-degenerate graphs , 2000 .

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

[3]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[4]  A. Kostochka.  The minimum Hadwiger number for graphs with a given mean degree of vertices , 1982 .

[5]  Joachim Kneis,et al.  Partial vs. Complete Domination: t-Dominating Set , 2007, SOFSEM.

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

[7]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[8]  Marco Cesati.  Perfect Code is W[1]-complete , 2000, Inf. Process. Lett..

[9]  Rolf Niedermeier,et al.  Parameterized Complexity of Vertex Cover Variants , 2007, Theory of Computing Systems.

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

[11]  A. Thomason.  An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

[13]  Andrew Thomason,et al.  The Extremal Function for Complete Minors , 2001, J. Comb. Theory B.

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

[15]  Stephan Kreutzer,et al.  Locally Excluding a Minor , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[16]  Judit Bar-Ilan,et al.  How to Allocate Network Centers , 1993, J. Algorithms.

[17]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[18]  Noga Alon,et al.  Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs , 2007, COCOON.

[19]  G DowneyRod,et al.  Fixed-Parameter Tractability and Completeness I , 1995 .

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

[21]  Omid Amini,et al.  Parameterized Algorithms for Partial Cover Problems , 2008, ArXiv.

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

[23]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

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