On Approximating Graph Bipartization via Node Deletion
Computational Complexity
2012-12-03 v2 Discrete Mathematics
Abstract
Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors.
Cite
@article{arxiv.1211.6724,
title = {On Approximating Graph Bipartization via Node Deletion},
author = {Bhaskar DasGupta and Lakshmi Kaligounder},
journal= {arXiv preprint arXiv:1211.6724},
year = {2012}
}
Comments
Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors