Parameterized Complexity of Connected Induced Subgraph Problems

For a graph property Π, i.e., a collection Π of graphs, the Connected Induced Π-Subgraph problem asks whether a graph G contains k vertices V′ such that the induced subgraph G[V′] is connected and belongs to Π.

[1]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[2]  J. Sirán,et al.  Moore Graphs and Beyond: A survey of the Degree/Diameter Problem , 2013 .

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

[4]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

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

[6]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[7]  Ezra Miller,et al.  Reciprocal Domains and Cohen-Macaulay d-Complexes in Rd , 2005, Electron. J. Comb..

[8]  Hannes Moser,et al.  The parameterized complexity of the induced matching problem , 2009, Discret. Appl. Math..

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

[10]  Venkatesh Raman,et al.  Parameterized complexity of the induced subgraph problem in directed graphs , 2007, Inf. Process. Lett..

[11]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[12]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.