Contemplations on testing graph properties
Webpage for a note by Oded Goldreich
This note 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 dense or bounded-degree ones).
In addition, this note includes a suggestion to view property
testing within the framework of promise problems.
Material available on-line
See also webpage on testing graph properties.
either Oded Goldreich's homepage.
or general list of papers.