Simpler Parameterized Algorithm for OCT

  • Daniel Lokshtanov
  • Saket Saurabh
  • Somnath Sikdar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5874)


We give a simple and intuitive fixed parameter tractable algorithm for the Odd Cycle Transversal problem, running in time O(3 k ·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].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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)MATHCrossRefMathSciNetGoogle Scholar
  3. 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)MATHCrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 5.
    Hüffner, F.: Algorithm engineering for optimal graph bipartization. Journal of Graph Algorithms and Applications 13(2), 77–98 (2009)MATHMathSciNetGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 7.
    Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)CrossRefGoogle Scholar
  8. 8.
    Reed, B., Vetta, A., Smith, K.: Finding Odd Cycle Transversals. Operations Research Letters 32, 229–301 (2004)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Daniel Lokshtanov
    • 1
  • Saket Saurabh
    • 1
  • Somnath Sikdar
    • 2
  1. 1.The University of BergenNorway
  2. 2.The Institute of Mathematical SciencesIndia

Personalised recommendations