Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Three Theorems Regarding Testing Graph Properties
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Introduction to testing graph properties
Property testing
Property testing of massively parametrized problems – a survey
Property testing
Introduction to testing graph properties
Property testing
Property testing of massively parametrized problems – a survey
Property testing
On the average-case complexity of property testing
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Inflatable graph properties and natural property tests
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On Proximity-Oblivious Testing
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A nearly-quadratic gap between adaptive and non-adaptive property testers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
"Tri, tri again": finding triangles and small subgraphs in a distributed setting
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Some remarks on barycentric-sum problems over cyclic groups
European Journal of Combinatorics
| Hi-index | 0.00 |
Let H be a fixed graph with h vertices, let G be a graph on n vertices, and suppose that at least εn2 edges have to be deleted from it to make it H-free. It is known that in this case G contains at least f(ε, H)nh copies of H. We show that the largest possible function f(ε, H) is polynomial in ε if and only if H is bipartite. This implies that there is a one-sided error property tester for checking H-freeness, whose query complexity is polynomial in 1/ε, if and only if H is bipartite.