Tight complexity bounds for FPT subgraph problems parameterized by the clique-width

We give tight algorithmic lower and upper bounds for some double-parameterized subgraph problems when the clique-width of the input graph is one of the parameters.

[1]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[2]  Stefan Szeider,et al.  Editing graphs to satisfy degree constraints: A parameterized approach , 2012, J. Comput. Syst. Sci..

[3]  Saket Saurabh,et al.  Capacitated Domination and Covering: A Parameterized Perspective , 2008, IWPEC.

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

[5]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[6]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..

[7]  Carsten Thomassen,et al.  Three-regular subgraphs of four-regular graphs , 1979, J. Graph Theory.

[8]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[9]  Egon Wanke,et al.  k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..

[10]  Iain A. Stewart.  Deciding whether a planar graph has a cubic subgraph is NP-complete , 1994, Discret. Math..

[11]  Dániel Marx,et al.  Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.

[12]  Hannes Moser,et al.  Parameterized complexity of finding regular induced subgraphs , 2009, J. Discrete Algorithms.

[13]  Dániel Marx,et al.  Slightly superexponential parameterized problems , 2011, SODA '11.

[14]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..

[15]  Michael R. Fellows,et al.  Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.

[16]  Yehoshua Perl,et al.  Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..

[17]  Ge Xia,et al.  On the computational hardness based on linear FPT-reductions , 2006, J. Comb. Optim..

[18]  Udi Rotics,et al.  Clique-Width is NP-Complete , 2009, SIAM J. Discret. Math..

[19]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 2000, J. Algorithms.

[20]  Guy Kortsarz,et al.  On Choosing a Dense Subgraph (Extended Abstract) , 1993, FOCS 1993.

[21]  Iain A. Stewart.  Finding Regular Subgraphs in Both Arbitrary and Planar Graphs , 1996, Discret. Appl. Math..

[22]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[23]  Petr Hlinený,et al.  Finding Branch-Decompositions and Rank-Decompositions , 2007, SIAM J. Comput..

[24]  Iain A. Stewart.  On locating cubic subgraphs in bounded-degree connected bipartite graphs , 1997, Discret. Math..

[25]  Ge Xia,et al.  Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..

[26]  Derek G. Corneil,et al.  The complexity of regular subgraph recognition , 1990, Discret. Appl. Math..

[27]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[28]  Omid Amini,et al.  Parameterized complexity of finding small degree-constrained subgraphs , 2012, J. Discrete Algorithms.

[29]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[30]  Stéphane Pérennes,et al.  On the approximability of some degree-constrained subgraph problems , 2012, Discret. Appl. Math..

[31]  Petr A. Golovach,et al.  Algorithmic lower bounds for problems parameterized by clique-width , 2010, SODA '10.

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

[33]  Daniel Lokshtanov,et al.  Planar Capacitated Dominating Set Is W[1]-Hard , 2009, IWPEC.

[34]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..