Skip to main content
SpringerLink
Log in

Parameterized Complexity of Even/Odd Subgraph Problems

  • Conference paper
Algorithms and Complexity (CIAC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6078))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of ACM 42, 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  4. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  6. Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289(2), 997–1008 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics 113, 109–128 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM Journal of Computing 19, 775–786 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong

    Leizhen Cai

  2. Department of Computer Science, University of Regina, Canada

    Boting Yang

Authors
  1. Leizhen Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boting Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Sapienza University of Rome, Via Salaria 113, 00198, Rome, Italy

    Tiziana Calamoneri

  2. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega 240, Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, L., Yang, B. (2010). Parameterized Complexity of Even/Odd Subgraph Problems. In: Calamoneri, T., Diaz, J. (eds) Algorithms and Complexity. CIAC 2010. Lecture Notes in Computer Science, vol 6078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13073-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13073-1_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13072-4

  • Online ISBN: 978-3-642-13073-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation