Article thumbnail
Location of Repository

By 

Abstract

20 (2000), pp. 451–476] showed that every property that is characterized by a finite collection of forbidden induced subgraphs is -testable. However, the complexity of the test is double-tower with respect to 1/, as the only tool known to construct such tests uses a variant of Szemerédi’s regularity lemma. Here we show that any property of bipartite graphs that is characterized by a finite collection of forbidden induced subgraphs is -testable, with a number of queries that is polynomial in 1/. Our main tool is a new “conditional ” version of the regularity lemma for binary matrices, which may be interesting on its own

Topics: Key words. property testing, graph algorithms, approximation, regularity lemma
Year: 2016
OAI identifier: oai:CiteSeerX.psu:10.1.1.738.3575
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cs.tau.ac.il/%7Enog... (external link)
  • http://www.cs.tau.ac.il/%7Enog... (external link)
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.