Skip to main content
SpringerLink
Log in

Simpler Parameterized Algorithm for OCT

  • Conference paper
Combinatorial Algorithms (IWOCA 2009)

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

Included in the following conference series:

Abstract

We give a simple and intuitive fixed parameter tractable algorithm for the Odd Cycle Transversal problem, running in time O(3k ·k ·|E| ·|V|). Our algorithm is best viewed as a reinterpretation of the classical Iterative Compression algorithm for Odd Cycle Transversal by Reed, Smith and Vetta [8].

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. Chen, J., Liu, Y., Lu, S., Razgon, I., O’Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. Journal of the ACM 55(5) (2008)

    Google Scholar 

  2. Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. Theory of Comput. Syst. 41(3), 479–492 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386–1396 (2006)

    Article  MATH  Google Scholar 

  4. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 711–722. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Hüffner, F.: Algorithm engineering for optimal graph bipartization. Journal of Graph Algorithms and Applications 13(2), 77–98 (2009)

    MATH  MathSciNet  Google Scholar 

  6. Marx, D.: Chordal deletion is fixed-parameter tractable. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 37–48. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  Google Scholar 

  8. Reed, B., Vetta, A., Smith, K.: Finding Odd Cycle Transversals. Operations Research Letters 32, 229–301 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Bergen, Norway

    Daniel Lokshtanov & Saket Saurabh

  2. The Institute of Mathematical Sciences, India

    Somnath Sikdar

Authors
  1. Daniel Lokshtanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Somnath Sikdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, NSW 2308, Callaghan, Australia

    Mirka Miller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lokshtanov, D., Saurabh, S., Sikdar, S. (2009). Simpler Parameterized Algorithm for OCT. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10217-2_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10216-5

  • Online ISBN: 978-3-642-10217-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation