The Two Bicliques Problem is in NP intersection coNP

Details The Two Bicliques Problem is in NP intersection coNP The Two Bicliques Problem is in NP intersection coNP

2011-04-18

arxiv.org/abs/1104.3463v4

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Two Bicliques Problem is in NP intersection coNP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Two Bicliques Problem is in NP intersection coNP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Two Bicliques Problem is in NP intersection coNP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72063