License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05291.3
URN: urn:nbn:de:0030-drops-5552
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/555/
Go to the corresponding Portal

Goldreich, Oded

Contemplations on Testing Graph Properties

pdf-format:
05291.GoldreichOded.Paper.555.pdf (0.6 MB)

Abstract

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

@InProceedings{goldreich:DagSemProc.05291.3,
  author =	{Goldreich, Oded},
  title =	{{Contemplations on Testing Graph Properties}},
  booktitle =	{Sublinear Algorithms},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5291},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/555},
  URN =		{urn:nbn:de:0030-drops-5552},
  doi =		{10.4230/DagSemProc.05291.3},
  annote =	{Keywords: Property testing, graph properties}
}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI