When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-5552
Go to the corresponding Portal

Goldreich, Oded

Contemplations on Testing Graph Properties

05291.GoldreichOded.Paper.555.pdf (0.6 MB)


This note documents two programmatic comments regarding testing graph properties, which I made during the workshop. 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.

BibTeX - Entry

  author =	{Oded Goldreich},
  title =	{Contemplations on Testing Graph Properties},
  booktitle =	{Sublinear Algorithms},
  year =	{2006},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  number =	{05291},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Property testing, graph properties}

Keywords: Property testing, graph properties
Seminar: 05291 - Sublinear Algorithms
Issue Date: 2006
Date of publication: 28.08.2006

DROPS-Home | Fulltext Search | Imprint Published by LZI