Simpler parameterized algorithm for OCT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5874 LNCS, Issue , 2009, Pages 380-384

  Lokshtanov, Daniel ^a   Saurabh, Saket ^a   Sikdar, Somnath ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION ALGORITHMS; FIXED PARAMETERS; ODD CYCLE; PARAMETERIZED ALGORITHM; RUNNING-IN; TRACTABLE ALGORITHMS;

ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 78650614345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10217-2_37     Document Type: Conference Paper

References (8)

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).
2. Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem. Theory of Comput. Syst. 41(3), 479-492 (2007).
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).
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).
5. Hüffner, F.: Algorithm engineering for optimal graph bipartization. Journal of Graph Algorithms and Applications 13(2), 77-98 (2009).
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).
7. Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006).
8. Reed, B., Vetta, A., Smith, K.: Finding Odd Cycle Transversals. Operations Research Letters 32, 229-301 (2004).