Testing versus estimation of graph properties

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 138-146

  Fischer, Eldar ^a   Newman, Ilan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Distance approximation; Graph properties; Property testing; Regularity lemma

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; ESTIMATION; INFORMATION ANALYSIS; MATHEMATICAL MODELS; QUERY LANGUAGES;

DISTANCE APPROXIMATION; GRAPH PROPERTIES; PROPERTY TESTING; REGULARITY LEMMA;

GRAPH THEORY;

EID: 34848884260     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060612     Document Type: Conference Paper

References (21)

1. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the Regularity Lemma, Journal of Algorithms 16 (1994), 80-109.
2. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451-476.
3. N. Alon and A. Shapira, Every monotone graph property is testable, to appear in this conference.
4. N. Alon and A. Shapira, private communication.
5. M. Blum, M. Luby and R. Rubinfeld, Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47 (1993), 549-595
6. nd STOC, 1990).
7. nd edition), Springer (2000).
8. E. Fischer, Testing graphs for colorability properties, Random Structures and Algorithms, to appear
9. th SODA, 2001).
10. 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.
11. E. Fischer, The difficulty of testing for isomorphism against a graph that is given in advance, SIAM Journal on Computing, to appear
12. th STOC, 2004).
13. th IEEE Conference on Computational Complexity (2005), to appear.
14. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM 45 (1998), 653-750
15. th FOCS, 1996).
16. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, Random Structures and Algorithms 23 (2003), 23-57.
17. M. Parnas, D. Ron and R. Rubinfeld, Tolerant property testing and distance approximation, available as ECCC Report TR04-010.
18. 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).
19. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996), 252-271
20. (first appeared as a technical report, Cornell University, 1993).
21. 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.), 2978, 399-401.