Parameterized Complexity of Even/Odd Subgraph Problems

  • Leizhen Cai
  • Boting Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6078)

Abstract

In this paper, we investigate the parameterized complexity of the problem of finding k edges (vertices) in a graph G to form a subgraph (respectively, induced subgraph) H such that H belongs to one the following four classes of graphs: even graphs, Eulerian graphs, odd graphs, and connected odd graphs. We also study the parameterized complexity of their parametric dual problems. Among these sixteen problems, we show that eight of them are fixed parameter tractable and four are W[1]-hard. Our main techniques are the color-coding method of Alon, Yuster and Zwick, and the random separation method of Cai, Chan and Chan.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of ACM 42, 844–856 (1995)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    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
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)CrossRefMATHGoogle Scholar
  5. 5.
    Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parameterized complexity of some fundamental problems in coding theory. SIAM Journal on Computing 29, 545–570 (1999)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289(2), 997–1008 (2002)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. of Computer System Science 20(2), 219–230 (1980)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of 36th Annual Symposium of Foundations of Computer Science (FOCS), pp. 182–191 (1995)Google Scholar
  9. 9.
    Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics 113, 109–128 (2001)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM Journal of Computing 19, 775–786 (1990)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Leizhen Cai
    • 1
  • Boting Yang
    • 2
  1. 1.Department of Computer Science and EngineeringThe Chinese University of Hong KongHong Kong
  2. 2.Department of Computer ScienceUniversity of ReginaCanada

Personalised recommendations