Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The effect of induced subgraphs on quasi-randomness
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On the density of a graph and its blowup
Journal of Combinatorial Theory Series B
Testing Boolean function isomorphism
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.00 |
Motivated by a question from [E. Fischer, G. Kindler, D. Ron, S. Safra, and A. Samorodnitsky, J. Comput. System Sci., 68 (2004), pp. 753--787], we investigate the number of queries required for testing that an input graph G is isomorphic to a fixed graph H that is given in advance. We correlate this number with a measure of the "complexity" of H that we define here, by proving both an upper bound and a lower bound on the number of queries that depends on this new measure. As far as we know this is the first characterization of this type for graphs.