Seminar on Sublinear Time Algorithms: Testing Bipartiteness in Bounded Degree Graphs
نویسنده
چکیده
Overview • Testing bipartiteness in sparse graphs • In dense graphs: Upperbound of poly(1) [1] – Sample vertices at random and test if their induced subgraph is bi-partite [No proof] • In sparse graphs we will see: – Upperbound of O(√ n · poly((lg n)//) [2] * We will analyze only the simple case of rapidly mixing graphs * Algorithm works much the say way for general graphs
منابع مشابه
Contemplations on Testing Graph Properties
This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). The first comment advocates paying more attention to the dependence of the tester’s complexity on the proximity parameter. The second comment advocates paying more attention to the question of testing general graphs (rather than...
متن کامل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 ~ (pn), where n is the number...
متن کاملOn the Benfits of Adaptivity in Property Testing of Dense Graphs
We consider the question of whether adaptivity can improve the complexity of property testing algorithms in the dense graphs model. Goldreich and Trevisan (Random Structures and Algorithms, 2003) have shown that there can be at most a quadratic gap between adaptive and non-adaptive testers in this model, but it was not known whether any gap indeed exists. In this work we reveal such a gap. Spec...
متن کاملQuantum Property Testing for Bounded-Degree Graphs
We study quantum algorithms for testing bipartiteness and expansion of bounded-degreegraphs. We give quantum algorithms that solve these problems in time Õ(N), beating theΩ(√N) classical lower bound. For testing expansion, we also prove an Ω̃(N) quantum querylower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantumalgorithms follow fr...
متن کاملFinding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k ≥ 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being Ck-minor free (resp., free from having the corresponding tree-minor). In particular, if the graph is Ω(1)-far from being cycle-free (i.e., a constant fraction of the ed...
متن کامل