Sciweavers

COCO
2004
Springer
93views Algorithms» more  COCO 2004»
13 years 10 months ago
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 g...
Andrej Bogdanov, Luca Trevisan