@inproceedings{aab13df4b63d4c46b747de20c6fb1617,

title = "Tight bounds for testing bipartiteness in general graphs",

abstract = "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,n2/m)) where m is the number of edges in the graph, and match it with an almost tight lower bound.",

keywords = "Average degree, Regular graph, query complexity, testing algorithm",

author = "Tali Kaufman and Michael Krivelevich and Dana Ron",

year = "2003",

doi = "10.1007/978-3-540-45198-3_29",

language = "אנגלית",

isbn = "3540407707",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "341--353",

editor = "Sanjeev Asora and Klaus Jansen and Rolim, {Jose D.P.} and Amit Sahai",

booktitle = "Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques",

}