Simpler Parameterized Algorithm for OCT

Authors:
Daniel Lokshtanov;Saket Saurabh;Somnath Sikdar
Affiliations:
The University of Bergen, Norway;The University of Bergen, Norway;The Institute of Mathematical Sciences, India
Venue:
Combinatorial Algorithms
Year:
2009

Citing 0
Cited 8

Compression via matroids: a randomized polynomial kernel for odd cycle transversal

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Note: A note on the parameterized complexity of unordered maximum tree orientation

Discrete Applied Mathematics
Parameterized algorithms for even cycle transversal

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Finding small separators in linear time via treewidth reduction

ACM Transactions on Algorithms (TALG)
Linear kernels and single-exponential algorithms via protrusion decompositions

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Another disjoint compression algorithm for odd cycle transversal

Information Processing Letters
A faster FPT algorithm for Bipartite Contraction

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].