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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 251-260

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

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Characterization; Property Testing; Regularity Lemma

Indexed keywords

PROPERTY TESTING; REGULARITY LEMMA; SZEMERÉDI-PARTITION;

CHARACTERIZATION; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; QUERY LANGUAGES;

GRAPH THEORY;

EID: 33748125492     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the Regularity Lemma, J. of Algorithms 16 (1994), 80-109.
2. st IEEE FOCS, IEEE (2000), 240-250.
3. th FOCS, New York, NY, IEEE (1999), 656-666.
4. Also: Combinatorica 20 (2000), 451-476.
5. N. Alon, M. Krivelevich, I. Newman and M. Szegedy, Regular languages are testable with a constant number of queries, SICOMP 30 (2001), 1842-1862.
6. N. Alon and M. Krivelevich, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), 211-227.
7. N. Alon and A. Shapira, Every monotone graph property is testable, Proc. of STOC 2005, 128-137.
8. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, Proc. of FOCS 2005, 429-438.
9. M. Ben-Or, D. Coppersmith, M. Luby and R. Rubinfeld, Non-abelian homomorphism testing, and distributions close to their self-convolutions, Proc. of RANDOM 2004, 273-285.
10. E. Ben-Sasson, P. Harsha and S. Raskhodnikova, Some 3-CNF properties are hard to test, Proc. of STOC 2003, 345-354.
11. M. Blum, M. Luby and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, JCSS 47 (1993), 549-595.
12. C. Borgs, J. Chayes, L. Lovász, V.T. Sós, B. Szegedy and K. Vesztergombi: Graph limits and parameter testing, Proc. of STOC 2006.
13. A. Czumaj, C. Sohler and M. Ziegler, Property testing in computational geometry, Proc. of ESA 2000, 155-166.
14. A. Czumaj and C. Sohler, Abstract combinatorial programs and efficient property testers, SICOMP 34 (2005), 580-615.
15. th SODA (2001), 873-882.
16. E. Fischer, The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The Bulletin of the EATCS 75 (2001), 97-126.
17. E. Fischer, The difficulty of testing for isomorphism against a graph that is given in advance, SICOMP, 34, 1147-1158.
18. E. Fischer, G. Kindler, D. Ron, S. Safra, and A. Samorodnitsky, Testing juntas, JCSS 68 (2004), 753-787.
19. Also, Proc. of FOCS (2002), 103-112.
20. E. Fischer and I. Newman, Testing versus estimation of graph properties, Proc. of STOC 2005, 138-146.
21. E. Fischer, I. Newman and J. Sgall, Functions that have read-twice constant width branching programs are not necessarily testable, Random Struc. and Alg., in press.
22. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld and A. Samorodnitsky, Monotonicity testing over general poset domains, Proc. of STOC (2002), 474-483.
23. K. Friedl, G. Ivanyos and M. Santha, Efficient testing of groups, Proc. of STOC (2005), 157-166.
24. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
25. O. Goldreich, Combinatorial property testing - a survey, In: Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMS-DIMACS (1998), 45-60.
26. O. Goldreich, Contemplations on testing graph properties, manuscript, 2005.
27. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation, JACM 45(4): 653-750 (1998).
28. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, Random Structures and Algorithms, 23 (2003), 23-57.
29. O. Goldreich and D. Ron, Property Testing in Bounded-Degree Graphs, Proc. of STOC 1997, 406-415.
30. J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory. In: Combinatorics, Paul Erdos is Eighty, Vol II (D. Miklośs, V. T. Sós, T. Szönyi eds.), János Bolyai Math. Soc., Budapest (1996), 295-352.
31. L. Lovász and B. Szegedy, Graph limits and testing hereditary graph properties, manuscript, 2005.
32. I. Newman, Testing of functions that have small width branching programs, Proc. of FOCS 2000, 251-258.
33. M. Parnas and D. Ron, Testing the diameter of graphs, Random structures and algorithms, 20 (2002), 165-183.
34. M. Parnas, D. Ron and R. Rubinfeld, Testing membership in parenthesis languages, Random Struct, and Algorithms 22 (2003), 98-138.
35. V. Rödl and R. Duke, On graphs with small subgraphs of large chromatic number, Graphs and Combinatorics 1 (1985), 91-96.
36. D. Ron, Property testing, in: P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, editors, Handbook of Randomized Computing, Vol. II, Kluwer Academic Publishers, 2001, 597-649.
37. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SICOMP 25 (1996), 252-271.
38. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.