The algorithmic aspects of the regularity lemma
Journal of Algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Property testing in massive graphs
Handbook of massive data sets
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
What is the furthest graph from a hereditary property?
Random Structures & Algorithms
Testing Closeness of Discrete Distributions
Journal of the ACM (JACM)
Hi-index | 0.01 |
Let P be a property of graphs. An \math-test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it has to be modified by adding and removing more than \math edges to make it satisfy P. The property P is called testable, if for every \math there exists an \math-test for P whose total number of queries is independent of the size of the input graph. Goldreich, Goldwasser and Ron [Property testing and its connection to learning and approximation, Proceedings of the 37th Annual IEEE FOCS (1996), 339--348] showed that certain graph properties admit an \math-test. In this paper we make a first step towards a logical characterization of all testable graph properties, and show that properties describable by a very general type of coloring problem are testable. We use this theorem to prove that first order graph properties not containing a quantifier alternation of type \math are always testable, while we show that some properties containing this alternation are not.Our results are proven using a combinatorial lemma, a special case of which, that may be of independent interest, is the following. A graph H is called \math-unavoidable in G if all graphs that differ from G in no more than \math|G|2 places contain an induced copy of H. A graph H is called \math-abundant in G if G contains at least \math|G