On Approximating Graph Bipartization via Node Deletion
classification
💻 cs.CC
cs.DM
keywords
resultsaccordinglyalthoughapproximatingauthorsbipartizationcorrectdeletion
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.