Another Disjoint Compression Algorithm for OCT
classification
💻 cs.DS
keywords
algorithmcompressioncycledisjointtransversalaboveanotherbelieve
read the original abstract
We describe an elegant O*(2^k) algorithm for the disjoint compression problem for Odd Cycle Transversal based on a reduction to Above Guarantee Vertex Cover. We believe that this algorithm refines the understanding of the Odd Cycle Transversal algorithm by Reed, Smith and Vetta.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.