Testing Bipartiteness of Graphs in Sublinear Time
Author:
Goldreich Oded,Ron Dana
Publisher
Springer New York
Reference13 articles.
1. Ben-Eliezer I, Kaufman T, Krivelevich M, Ron D (2012) Comparing the strength of query types in property testing: the case of testing k-colorability. Comput Complex 22(1):89–135
2. Bogdanov A, Obata K, Trevisan L (2002) A lower bound for testing 3-colorability in bounded-degree graphs. In: Proceedings of the forty-third annual symposium on foundations of computer science (FOCS), Los Alamitos, pp 93–102
3. Czumaj A, Goldreich O, Ron D, Seshadhri C, Shapira A, Sohler C (2012) Finding cycles and trees in sublinear time. Technical Report TR12-035, Electronic Colloquium on Computational Complexity (ECCC), to appear in Random Structures and Algorithms
4. Goldreich O (2010) Introduction to testing graph properties, in [5]
5. Goldreich O (ed) (2010) Property testing: current research and surveys. LNCS, vol 6390. Springer, Heidelberg