A characterization of the (natural) graph properties testable with one-sided error

SIAM Journal on Computing

Volumn 37, Issue 6, 2007, Pages 1703-1727

  Alon, Noga ^a,b   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Hereditary properties; One sided error; Property testing; Regularity lemma

Indexed keywords

GRAPH PROPERTIES; HEREDITARY GRAPH PROPERTIES; HEREDITARY PROPERTIES; INPUT GRAPHS; ONE-SIDED ERROR; OPEN PROBLEMS; PROPERTY TESTERS; PROPERTY TESTING; REGULARITY LEMMA; TECHNICAL CONTRIBUTIONS;

COMPUTER SCIENCE; TOPOLOGY;

GRAPH THEORY;

EID: 49649088238     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/06064888X     Document Type: Conference Paper

References (38)

1. N. ALON, Testing subgraphs in large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370.
2. N. ALON, E. FISCHER, I. NEWMAN, AND A. SHAPIRA, A combinatorial characterization of the testable graph properties: It's all about regularity, in STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 251-260.
3. 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.
4. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
5. 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.
6. N. ALON AND M. KRIVELEVICH, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227.
7. N. ALON AND A. SHAPIRA, A characterization of easily testable induced subgraphs, Combin., Probab. Comput., 15 (2006), pp. 791-805.
8. N. ALON AND A. SHAPIRA, Testing satisfiability, J. Algorithms, 47 (2003), pp. 87-103.
9. N. ALON AND A. SHAPIRA, Testing subgraphs in directed graphs, J. Comput. System Sci., 69 (2004), pp. 353-382.
10. N. ALON AND A. SHAPIRA, A separation theorem in property-testing, Combinatorica, to appear.
11. N. ALON AND A. SHAPIRA, Every monotone graph-property is testable, SIAM J. Comput., to appear.
12. N. ALON AND A. SHAPIRA, Homomorphisms in graph property testing, in Topics in Discrete Mathematics, Springer, Berlin, 2006, pp. 281-313.
13. N. ALON AND U. STAV, What Is the Furthest Graph from a Hereditary Property?, manuscript, 2006.
14. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
15. T. M. CHAN, Polynomial-time approximation schemes for packing and piercing fat objects, J. Algorithms, 46 (2003), pp. 178-189.
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. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
18. E. FISCHER AND I. NEWMAN, Testing versus estimation of graph properties, in STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 138-146.
19. 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.
20. P. FRANKL AND Z. FÜREDI, Colored packings of sets, in Combinatorial Design Theory, North-Holland, Amsterdam, 1987, pp. 165-177.
21. O. GOLDREICH, Combinatorial property testing (a survey), in Randomization Methods in Algorithm Design, P. Pardalos, S. Rajasekaran, and J. Rolim, eds., AMS, Providence, RI, 1998, pp. 45-59.
22. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
23. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
24. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
25. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, London, Toronto, 1980.
26. J. KOMLÓS AND M. SIMONOVITS, Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics, Paul Erdo{double acute}s is Eighty, Vol. II, D. Miklós, V. T. Sós, and T. Szo{double acute}nyi, eds., János Bolyai Mathematical Society, Budapest, Hungary, 1996, pp. 295-352.
27. L. LOVÁSZ AND B. SZEGEDY, Graph Limits and Testing Hereditary Graph Properties, manuscript, 2006.
28. T. A. MCKEE AND F. R. MCM ORRIS, Topics in Intersection Graph Theory, SIAM, Philadelphia, 1999.
29. I. NEWMAN, Testing of functions that have small width branching programs, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 251-258.
30. M. PARNAS AND D. RON, Testing the diameter of graphs, Random Structures Algorithms, 20 (2002), pp. 165-183.
31. H. J. PROMEL AND A. STEGER, Excluding induced, subgraphs. III. A general asymptotic. Random Structures Algorithms, 3 (1992), pp. 19-31.
32. J. L. RAMÍREZ-ALFONSÍN AND B. A. REED, EDS., Perfect Graphs, Wiley, Chichester, 2001.
33. V. RÖDL AND R. DUKE, On graphs with small subgraphs of large chromatic number, Graphs Combin., 1 (1985), pp. 91-96.
34. V. RÖDL AND M. SCHACHT, Property testing in hypergraphs and the removal lemma, in STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, to appear.
35. D. RON, Property testing, in Handbook of Randomized Computing, Vol. II, P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
36. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
37. E. SZEMERÉDI, Regular partitions of graphs, in Problémes combinatoires et théorie des graphes, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.
38. V. Vu, New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help, Random Structures Algorithms, 17 (2000), pp. 29-63.