The difficulty of testing for isomorphism against a graph that is given in advance

Authors:
Eldar Fischer
Affiliations:
Technion--Israel Institute of Technology, Haifa, Israel
Venue:
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Year:
2004

Citing 7
Cited 2

Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Testing graphs for colorable properties

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing of matrix properties

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Testing Juntas

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Three theorems regarding testing graph properties

Random Structures & Algorithms

Property testing and the branching program size of boolean functions

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Testing linear-invariant function isomorphism

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by a question from [6], we investigate the number of queries required for testing that an input graph G is isomorphic to a graph H that is given in advance. Our main result is that the more "complex" H is, the more queries it takes to test an input graph G for the property of being isomorphic to H. This is provided in terms of an upper bound and a lower bound on the number of queries, giving a relation between this number and a natural measure of the complexity of H.