Another Disjoint Compression Algorithm for OCT
R.Krithika, N.S.Narayanaswamy

TL;DR
This paper introduces an efficient O*(2^k) algorithm for the disjoint compression problem in Odd Cycle Transversal, utilizing a reduction to Above Guarantee Vertex Cover, enhancing the understanding of existing algorithms.
Contribution
It presents a novel algorithm that refines the complexity and approach for solving the disjoint compression problem in Odd Cycle Transversal.
Findings
Algorithm operates in O*(2^k) time
Reduces problem to Above Guarantee Vertex Cover
Improves understanding of Odd Cycle Transversal algorithms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · graph theory and CDMA systems · Advanced Graph Theory Research
