Advertisement

Parameterized Complexity of Connected Induced Subgraph Problems

  • Leizhen Cai
  • Junjie Ye
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8546)

Abstract

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 Π.

In this paper, we regard k as a parameter and study the parameterized complexity of Connected Induced Π-Subgraph for hereditary properties Π. We give an almost complete characterization in terms of whether Π includes all complete graphs, all stars, or all paths: FPT if Π includes all complete graphs and stars, or excludes some complete graphs, stars and paths; and W[1]-hard otherwise (except the case that Π includes all complete graphs and paths but exclude some stars). For the remaining case, we show that it is W[1]-hard if Π includes all complete graphs K t , excludes a star K 1,s but includes all trees of maximum degree less than s. Our results imply a complete characterization for Π being H-free graphs for a fixed graph H: W[1]-hard if H is K t with t ≥ 3 or K 1,s with s ≥ 2, and FPT otherwise.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 239–250. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)CrossRefGoogle Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New York (1979)zbMATHGoogle Scholar
  5. 5.
    Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289(2), 997–1008 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences 20(2), 219–230 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Miller, M., Širán, J.: Moore graphs and beyond: a survey of the degree/diameter problem. Electronic Journal of Combinatorics 61, 1–63 (2005)Google Scholar
  8. 8.
    Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discrete Applied Mathematics 157(4), 715–727 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of the 36th Annual Symposium of Foundations of Computer Science, pp. 182–191 (1995)Google Scholar
  10. 10.
    Raman, V., Sikdar, S.: Parameterized complexity of the induced subgraph problem in directed graphs. Information Processing Letters 104(3), 79–85 (2007)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Leizhen Cai
    • 1
  • Junjie Ye
    • 1
  1. 1.Department of Computer Science and EngineeringThe Chinese University of Hong KongShatinHong Kong

Personalised recommendations