1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
R. Krithika, N. S. Narayanaswamy
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 a…