Simpler Parameterized Algorithm for OCT

DOI10.1007/978-3-642-10217-2_37zbMath1267.05268OpenAlexW1621031363MaRDI QIDQ3651564

Saket Saurabh, Daniel Lokshtanov, Somnath Sikdar

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_37

zbMATH Keywords

iterative compression algorithmodd cycle transversal problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Optimizing adiabatic quantum program compilation using a graph-theoretic framework ⋮ List-coloring -- parameterizing from triviality ⋮ Hitting Selected (Odd) Cycles ⋮ An Updated Experimental Evaluation of Graph Bipartization Methods ⋮ Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs ⋮ A note on the parameterized complexity of unordered maximum tree orientation ⋮ Another disjoint compression algorithm for odd cycle transversal ⋮ A faster FPT algorithm for bipartite contraction ⋮ Faster algorithms for vertex partitioning problems parameterized by clique-width ⋮ Edge bipartization faster than \(2^k\) ⋮ Unnamed Item

This page was built for publication: Simpler Parameterized Algorithm for OCT