Lower Bounds for Testing Bipartiteness in Dense Graphs

We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and graphs that are -far from bipartite using ˜O(1/ 2 ) queries. We show that this is optimal for non-adaptive algorithms, up to polylogarithmic factors. We also show a lower bound of Ω(1/ 3/2 ) for adaptive algorithms.

• Type: Conference
• Year: 2004
• Where: COCO
• Authors: Andrej Bogdanov, Luca Trevisan
• Keywords: Adjacency Matrix Model, Bipartite Graphs, COCO 2004, Testing Bipartiteness