Tight Bounds for Testing Bipartiteness in General Graphs

In this paper we consider the problem of testing bipartiteness of general graphs. The problem has previously been studied in two models, one most suitable for dense graphs, and one most suitable for bounded-degree graphs. Roughly speaking, dense graphs can be tested for bipartiteness with constant complexity, while the complexity of testing bounded-degree graphs is θ?(√n), where n is the number of vertices in the graph. Thus there is a large gap between the complexity of testing in the two cases. In this work we bridge the gap described above. In particular, we study the problem of testing bipartiteness in a model that is suitable for all densities. We present an algorithm whose complexity is O(min(√n, n 2 /m)) where m is the number of edges in the graph, and match it with an almost tight lower bound.

[1]  Milena Mihail,et al.  Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1999, Comb..

[3]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[4]  Dana Ron,et al.  On Estimating the Average Degree of a Graph , 2004, Electron. Colloquium Comput. Complex..

[5]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[6]  Noga Alon,et al.  Testing subgraphs in large graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[8]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[9]  Michael A. Bender,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002, Random Struct. Algorithms.

[10]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11]  Luca Trevisan,et al.  Lower bounds for testing bipartiteness in dense graphs , 2004 .

[12]  Noga Alon.  Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.

[13]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, SIAM J. Comput..

[14]  B. Bollobás,et al.  Extremal Graphs without Large Forbidden Subgraphs , 1978 .

[15]  Artur Czumaj,et al.  Abstract Combinatorial Programs and Efficient Property Testers , 2005, SIAM J. Comput..

[16]  Kenji Obata,et al.  A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[18]  Alexander Lubotzky,et al.  Explicit expanders and the Ramanujan conjectures , 1986, STOC '86.

[19]  Noga Alon,et al.  Testing k-colorability , 2002, SIAM J. Discret. Math..

[20]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, Comb..

[21]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[22]  D. Ron,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002 .

[23]  Uriel Feige.  Sampling Vertex Degrees and Estimating Network Load Parameters , 2003 .

[24]  D. Ron,et al.  Testing the diameter of graphs , 2002 .

[25]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.