The subgraph testing model

Oded Goldreich, Dana Ron

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publication10th Innovations in Theoretical Computer Science, ITCS 2019
EditorsAvrim Blum
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770958
StatePublished - 1 Jan 2019
Event10th Innovations in Theoretical Computer Science, ITCS 2019 - San Diego, United States
Duration: 10 Jan 201912 Jan 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference10th Innovations in Theoretical Computer Science, ITCS 2019
Country/TerritoryUnited States
CitySan Diego


  • Graph properties
  • Property testing


Dive into the research topics of 'The subgraph testing model'. Together they form a unique fingerprint.

Cite this