66 search results - page 1 / 14 » Algorithmic Aspects of Property Testing in the Dense Graphs ... |
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...
APPROX
2007
Springer
13 years 8 months ago
2007
Springer
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...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...