Location of Repository

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. 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

Topics:
Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics

Year: 2011

OAI identifier:
oai:arXiv.org:1104.3463

Provided by:
arXiv.org e-Print Archive

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.