Sciweavers

FOCS
2005
IEEE
13 years 10 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
13 years 11 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
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 ...
Oded Goldreich, Dana Ron