ECCC-Report TR18-045https://eccc.weizmann.ac.il/report/2018/045Comments and Revisions published for TR18-045en-usMon, 22 Jun 2020 05:38:08 +0300
Revision 2
| The Subgraph Testing Model |
Oded Goldreich,
Dana Ron
https://eccc.weizmann.ac.il/report/2018/045#revision2We initiate a study of testing properties of graphs that are presented as subgraphs of a fixed (or an explicitly given) graph.
The tester is given free access to a base graph $G=([\n],E)$, and oracle access to a function $f:E\to\{0,1\}$ that represents a subgraph of $G$.
The tester is required to distinguish between subgraphs that posses a predetermined property and subgraphs that are far from possessing this property.
We focus on bounded-degree base graphs and on the relation between testing graph properties in the subgraph model and testing the same properties in the bounded-degree graph model.
We identify cases in which testing is significantly easier in one model than in the other as well as cases in which testing has approximately the same complexity in both models.
Our proofs are based on the design and analysis of efficient testers and on the establishment of query-complexity lower bounds.
Mon, 22 Jun 2020 05:38:08 +0300https://eccc.weizmann.ac.il/report/2018/045#revision2
Revision 1
| The Subgraph Testing Model |
Oded Goldreich,
Dana Ron
https://eccc.weizmann.ac.il/report/2018/045#revision1We initiate a study of testing properties of graphs that are presented as subgraphs of a fixed (or an explicitly given) graph.
The tester is given free access to a base graph $G=([\n],E)$, and oracle access to a function $f:E\to\{0,1\}$ that represents a subgraph of $G$.
The tester is required to distinguish between subgraphs that posses a predetermined property and subgraphs that are far from possessing this property.
We focus on bounded-degree base graphs and on the relation between testing graph properties in the subgraph model and testing the same properties in the bounded-degree graph model.
We identify cases in which testing is significantly easier in one model than in the other as well as cases in which testing has approximately the same complexity in both models.
Our proofs are based on the design and analysis of efficient testers and on the establishment of query-complexity lower bounds.
Wed, 12 Feb 2020 18:35:55 +0200https://eccc.weizmann.ac.il/report/2018/045#revision1
Paper TR18-045
| The Subgraph Testing Model |
Oded Goldreich,
Dana Ron
https://eccc.weizmann.ac.il/report/2018/045We initiate a study of testing properties of graphs that are presented as subgraphs of a fixed (or an explicitly given) graph.
The tester is given free access to a base graph $G=([\n],E)$, and oracle access to a function $f:E\to\{0,1\}$ that represents a subgraph of $G$.
The tester is required to distinguish between subgraphs that posses a predetermined property and subgraphs that are far from possessing this property.
We focus on bounded-degree base graphs and on the relation between testing graph properties in the subgraph model and testing the same properties in the bounded-degree graph model.
We identify cases in which testing is significantly easier in one model than in the other as well as cases in which testing has approximately the same complexity in both models.
Our proofs are based on the design and analysis of efficient testers and on the establishment of query-complexity lower bounds.
Tue, 06 Mar 2018 17:56:08 +0200https://eccc.weizmann.ac.il/report/2018/045