Tali Kaufman, Michael Krivelevich, Dana Ron. Tight Bounds for Testing Bipartiteness in General Graphs. In Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai, editors, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx. Volume 2764 of Lecture Notes in Computer Science, pages 341-353, Springer, 2003. [doi]
Abstract is missing.