English

Another Disjoint Compression Algorithm for OCT

Data Structures and Algorithms 2013-03-08 v1

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.

Cite

@article{arxiv.1303.1671,
  title  = {Another Disjoint Compression Algorithm for OCT},
  author = {R. Krithika and N. S. Narayanaswamy},
  journal= {arXiv preprint arXiv:1303.1671},
  year   = {2013}
}
R2 v1 2026-06-21T23:38:09.911Z