A combinatorial characterization of the testable graph properties: It's all about regularity

SIAM Journal on Computing

Volumn 39, Issue 1, 2009, Pages 143-167

  Alon, Noga ^a,b   Fischer, Eldar ^c   Newman, Ilan ^d   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b ISR   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d UNIVERSITY OF HAIFA   (Israel)

Author keywords

Characterization; Property testing; Regularity lemma; Testable

Indexed keywords

DENSE GRAPHS; GRAPH PROPERTIES; OPEN PROBLEMS; PROPERTY TESTING; REGULARITY LEMMA; TESTABLE;

COMPUTATION THEORY;

GRAPH THEORY;

EID: 67650118857     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060667177     Document Type: Conference Paper

References (38)

1. N. ALON, R. A. DUKE, H. LEFMANN, V. RODL, AND R. YUSTER, The algorithmic aspects of the regularity lemma, J. Algorithms, 16 (1994), pp. 80-109.
2. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of clustering, SIAM J. Discrete Math., 16 (2003), pp. 393-417.
3. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
4. N. ALON, M. KRIVELEVICH, I. NEWMAN, AND M. SZEGEDY, Regular languages are testable with a constant number of queries, SIAM J. Comput., 30 (2001), pp. 1842-1862.
5. N. ALON AND M. KRIVELEVICH, Testing κ-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227.
6. N. ALON AND A. SHAPIRA, Every monotone graph property is testable, SIAM J. Comput., 38 (2008), pp. 505-522.
7. N. ALON AND A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput., 37 (2008), pp. 1703-1727.
8. N. ALON AND A. SHAPIRA, A separation theorem in property testing, Combinatorica, to appear.
9. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd edition, John Wiley & Sons, New York, 2000.
10. M. BEN-OR, D. COPPERSMITH, M. LUBY, AND R. RUBINFELD, Non-abelian homomorphism testing, and distributions close to their self-convolutions, Random Structures Algorithms, 32 (2008), pp. 49-70.
11. E. BEN-SASSON, P. HARSHA, AND S. RASKHODNIKOVA, Some 3CNF properties are hard to test, SIAM J. Comput., 35 (2005), pp. 1-21.
12. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
13. C. BORGS, J. CHAYES, L. LOVASZ, V. T. Sós, B. SZEGEDY, AND K. VESZTERGOMBI, Graph limits and parameter testing, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, 2006, ACM, New York, 2006, pp. 261-270.
14. A. CZUMAJ, C. SOHLER, AND M. ZIEGLER, Property testing in computational geometry, in Proceedings of the Eighth Annual European Symposium, Saarbrucken, Germany, 2000, Lecture Notes in Comput. Sci. 1879, Springer, Berlin, 2000, pp. 155-166.
15. A. CZUMAJ AND C. SOHLER, Abstract combinatorial programs and efficient property testers, SIAM J. Comput., 34 (2005), pp. 580-615.
16. E. FISCHER, Testing graphs for colorability properties, Random Structures Algorithms, 26 (2005), pp. 289-309.
17. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
18. E. FISCHER, The difficulty of testing for isomorphism against a graph that is given in advance, SIAM J. Comput., 34 (2005), pp. 1147-1158.
19. E. FISCHER, G. KINDLER, D. RON, S. SAFRA, AND A. SAMORODNITSKY, Testing juntas, J. Comput. System Sci., 68 (2004), pp. 753-787.
20. E. FISCHER AND I. NEWMAN, Testing versus estimation of graph properties, SIAM J. Comput., 37 (2007), pp. 482-501.
21. E. FISCHER, I. NEWMAN, AND J. SGALL, Functions that have read-twice constant width branching programs are not necessarily testable, Random Structures Algorithms, 24 (2004), pp. 175-193.
22. E. FISCHER, E. LEHMAN, I. NEWMAN, S. RASKHODNIKOVA, R. RUBINFELD, AND A. SAMORODNITSKY, Monotonicity testing over general poset domains, Proc. of STOC (2002), pp. 474-483.
23. K. FRIEDL, G. IVANYOS, AND M. SANTHA, Efficient testing of groups, in Proceedings of the 37th Annual STOC, Baltimore, MD, 2005, pp. 157-166.
24. A. FRIEZE AND R. KANNAN, Quick approximation to matrices and applications, Combinatorica, 19 (1999), pp. 175-220.
25. O. GOLDREICH, Combinatorial property testing (a survey), in Randomization Methods in Algorithm Design, P. Pardalos, S. Rajasekaran, and J. Rolim, eds., DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 43, AMS, Providence, RI, 1999, pp. 45-59.
26. O. GOLDREICH, Contemplations on testing graph properties, manuscript, 2005; available online at http://www.wisdom.weizmann.ac.il/~oded.
27. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
28. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
29. O. GOLDREICH AND D. RON, Property Testing in Bounded-Degree Graphs, Algorithmica, 32 (2002), pp. 302-343.
30. T. GOWERS, Lower bounds of tower type for Szemerédi's uniformity lemma, Geom. Funct. Anal., 7 (1997), pp. 322-337.
31. J. KOMLOS AND M. SIMONOVITS, Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics, Paul Erdos is Eighty, Vol II, D. Miklós, V. T. Sós, and T. Szönyi, eds., János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
32. I. NEWMAN, Testing of functions that have small width branching programs, in Proceedings of the 41st Annual Symposium on FOCS, Redondo Beach, CA, 2000, pp. 251-258.
33. M. PARNAS AND D. RON, Testing the diameter of graphs, Random Structures Algorithms, 20 (2002), pp. 165-183.
34. M. PARNAS, D. RON, AND R. RUBINFELD, Testing membership in parenthesis languages, Random Structures Algorithms, 22 (2003), pp. 98-138.
35. V. RÖDL AND R. DUKE, On graphs with small subgraphs of large chromatic number, Graphs Combin., 1 (1985), pp. 91-96.
36. D. RON, Property testing, in Handbook of Randomized Computing, P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds., Vol. II, Kluwer Academic Publishers, Dordrecht, 2001, pp. 597-649.
37. R. RUBINFELD AND M. SUDAN, Robust characterization of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
38. E. SZEMERÉDI, Regular partitions of graphs, in Colloq. Internat. CNRS, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.