Clique problem, cutting plane proofs and communication complexity

Details Clique problem, cutting plane proofs and communication complexity Clique problem, cutting plane proofs and communication complexity

2012-03-24

arxiv.org/abs/1203.5414v2

Computer Science

Computational Complexity

10 pages. Theorem 1 in the previous version holds only for bipartite graphs, the non-bipartite case remains open. I now separa

Scientific paper

Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we consider the following communication game on a given graph G, known to both players. Let K be the maximal number of vertices in a complete bipartite subgraph of G, which is not necessarily an induced subgraph if G is not bipartite. Alice gets a set A of vertices, and Bob gets a disjoint set B of vertices such that |A|+|B|>K. The goal is to find a nonedge of G between A and B. We show that O(\log n) bits of communication are enough for every n-vertex graph.

Affiliated with

Also associated with

No associations

Rating

Clique problem, cutting plane proofs and communication complexity 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 Clique problem, cutting plane proofs and communication complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clique problem, cutting plane proofs and communication complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39114