TY - GEN

T1 - The subgraph testing model

AU - Goldreich, Oded

AU - Ron, Dana

N1 - Publisher Copyright:
© Oded Goldreich and Dana Ron.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We 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 → {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.

AB - We 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 → {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.

KW - Graph properties

KW - Property testing

UR - http://www.scopus.com/inward/record.url?scp=85069479990&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ITCS.2019.37

DO - 10.4230/LIPIcs.ITCS.2019.37

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85069479990

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 10th Innovations in Theoretical Computer Science, ITCS 2019

A2 - Blum, Avrim

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 10th Innovations in Theoretical Computer Science, ITCS 2019

Y2 - 10 January 2019 through 12 January 2019

ER -