We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...