The Two Bicliques Problem is in NP intersection coNP
Computational Complexity
2015-03-19 v4 Data Structures and Algorithms
Combinatorics
Abstract
We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NPcoNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite some time. Our result implies that a polynomial time algorithm for the problem is more likely than it being NP-complete unless P = NP.
Cite
@article{arxiv.1104.3463,
title = {The Two Bicliques Problem is in NP intersection coNP},
author = {M. A. Shalu and S. Vijayakumar},
journal= {arXiv preprint arXiv:1104.3463},
year = {2015}
}