Testing versus estimation of graph properties

SIAM Journal on Computing

Volumn 37, Issue 2, 2007, Pages 482-501

  Fischer, Eldar ^a   Newman, Ilan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation; Graph algorithms; Property testing; Regularity lemma

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBABILITY; QUERY PROCESSING; THEOREM PROVING;

GRAPH ALGORITHMS; PROBABILISTIC ALGORITHMS; PROPERTY TESTING; REGULARITY LEMMA;

GRAPH THEORY;

EID: 42549151549     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060652324     Document Type: Article

References (18)

1. N. ALON, R. A. DUKE, H. LEFMANN, V. RÖDL, AND R. YUSTER, The algorithmic aspects of the regularity lemma, J. Algorithms, 16 (1994), pp. 80-109.
2. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large gruphs, Combinatorica, 20 (2000), pp. 451-476.
3. N. ALON, E. FISCHER, I. NEWMAN, AND A. SHAPIRA, A combinatorial characterization of the testable graph properties: It's all about regularity, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 2006, pp. 251-260.
4. N. ALON AND A. SHAPIRA, Every monotone graph property is testable, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005, pp. 128-137.
5. N. ALON AND A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2005, pp. 429-438.
6. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
7. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
8. R. DIESTEL, Graph Theory, 2nd ed., Springer-Verlag, New York, 2000.
9. E. FISCHER, Testing graphs for colorability properties, Random Structures Algorithms, 26 (2005), pp. 289-309.
10. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
11. E. FISCHER, The difficulty of testing for isomorphism against a graph that is given in advance, SIAM J. Comput., 34 (2005), pp. 1147-1158.
12. E. FISCHER AND L. FORTNOW, Tolerant versus intolerant testing for Boolean properties, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity, 2005, pp. 135-140.
13. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
14. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
15. M. PARNAS, D. RON, AND R. RUBINFELD, Tolerant property testing and distance approximation, J. Comput. System Sci., 72 (2006) pp. 1012-1042.
16. D. RON, Property testing (a tutorial), in Handbook of Randomized Computing, Vol. II, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Boston, 2001, pp. 597-649.
17. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
18. E. SZEMERÉDI, Regular partitions of graphs, in Problèmes combinatoires et théorie des graphes, Colloq. Internat. CNRS 260, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.