DagSemProc.05291.3.pdf
- Filesize: 0.6 MB
- 7 pages
Document
Contemplations on Testing Graph Properties
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5291
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-08-28
Cite AsGet BibTex
Oded Goldreich. Contemplations on Testing Graph Properties. In Sublinear Algorithms. Dagstuhl Seminar Proceedings, Volume 5291, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.05291.3
https://doi.org/10.4230/DagSemProc.05291.3
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.
Keywords
- Property testing
- graph properties
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads