arXiv
Open Access
2013
Another Disjoint Compression Algorithm for OCT
R. Krithika
N. S. Narayanaswamy
Abstrak
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.
Topik & Kata Kunci
Penulis (2)
R
R. Krithika
N
N. S. Narayanaswamy
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2013
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓