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

SIAM Journal on Computing

Volumn 34, Issue 5, 2005, Pages 1147-1158

  Fischer, Eldar ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Graph isomorphism; Property testing; Regularity lemma

Indexed keywords

BOUNDARY CONDITIONS; CHARACTERIZATION; CORRELATION THEORY;

GRAPH ISOMORPHISM; PROPERTY TESTING; REGULARITY LEMMA;

GRAPH THEORY;

EID: 27144512264     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970445603     Document Type: Article

References (16)

1. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
2. N. ALON AND J. H. SPENCER, The Probabilistic Method, Wiley-Intersci. Ser. Discrete Math. Optim., 2nd ed., Wiley-Interscience (John Wiley & Sons), New York, 2000.
3. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
4. A preliminary version appeared in Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (STOC), 1990.
5. E. FISCHER, Testing graphs for colorability properties, Random Structures Algorithms, 26 (2005), pp. 289-309.
6. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
7. E. FISCHER, G. KINDLER, D. RON, S. SAFRA, AND A. SAMORODNITSKY, Testing juntas, J. Comput. System Sci., 68 (2004), pp. 753-787.
8. E. FISCHER AND A. MATZLIAH, Testing Graphic Isomorphism, manuscript, Technion - Israel Institute of Technology, Haifa, Israel, 2005.
9. E. FISCHER AND I. NEWMAN, Testing versus estimation of graph properties, in Proceedings of the 37th Annual ACM Symposium on the Theory of Computing (STOC), to appear.
10. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
11. A preliminary version appeared in Proceedings of the 37th FOCS, 1996.
12. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
13. D. RON, Property testing, in Handbook of Randomized Computing, Vols. I, II, Comb. Optim. 9, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
14. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
15. First appeared as a technical report, Cornell University, 1993.
16. E. SZEMERÉDI, Regular partitions of graphs, in Proceedings of the Colloque International CNRS, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., Colloq. Internat. CNRS 260, CNRS, Paris, 1978, pp. 399-401.