Skip to main content
Article thumbnail
Location of Repository

The Two Bicliques Problem is in NP intersection coNP

By M. A. Shalu and S. Vijayakumar

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 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
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.3463 (external link)
  • Suggested articles


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