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

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 391-397

  Fischer, Eldar ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Graph Isomorphism; Property Testing; Regularity Lemma

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILISTIC LOGICS; PROBLEM SOLVING;

GRAPH ISOMORPHISMS; GRAPH PROPERTY TESTING; PROPERTY TESTING; REGULARITY LEMMA;

COMPUTATIONAL COMPLEXITY;

EID: 4544334668     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007415     Document Type: Conference Paper

References (16)

1. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451-476.
2. nd edition).
3. nd STOC, 1990).
4. nd STOC, 1990).
5. th ACM-SIAM SODA (2001), 873-882.
6. E. Fischer, The art of uninformed decisions: A primer to property testing, The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126.
7. nd FOCS, 2002).
8. nd FOCS, 2002).
9. rd ACM STOC (2001), 286-295.
10. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation. Journal of the ACM 45 (1998), 653-750
11. th FOCS, 1996).
12. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, Random Structures and Algorithms 23 (2003), 23-57.
13. D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds), Kluwer Press (2001).
14. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996), 252-271 (first appeared as a technical report, Cornell University, 1993).
15. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996), 252-271 (first appeared as a technical report, Cornell University, 1993).
16. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), 1978, 399-401.