21 search results - page 1 / 5 » On the Benefits of Adaptivity in Property Testing of Dense G... |
APPROX
2007
Springer
13 years 8 months ago
2007
Springer
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
ECCC
2006
13 years 4 months ago
2006
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...