Testing hereditary properties of nonexpanding bounded-degree graphs

SIAM Journal on Computing

Volumn 38, Issue 6, 2009, Pages 2499-2510

  Czumaj, Artur ^a   Shapira, Asaf ^b   Sohler, Christian ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

Approximation algorithms; Bounded degree graphs; Hereditary graph properties; Nonexpanding graphs; Planar graphs; Property testing; Randomized algorithms

Indexed keywords

BOUNDED-DEGREE GRAPHS; HEREDITARY GRAPH PROPERTIES; NONEXPANDING GRAPHS; PLANAR GRAPHS; PROPERTY TESTING; RANDOMIZED ALGORITHMS;

APPROXIMATION ALGORITHMS;

GRAPH THEORY;

EID: 65949087650     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070681831     Document Type: Article

References (20)

1. 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), ACM, New York, 2006, pp. 251-260.
2. N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for graphs with an excluded minor and its applications, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1990, pp. 293-299.
3. N. ALON AND A. SHAPIRA, Every monotone graph property is testable, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2005, pp. 128-137.
4. 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.
5. N. ALON AND A. SHAPIRA, A separation theorem in property testing, Combinatorica, 28 (2008), pp. 261-281.
6. M. A. BENDER AND D. RON, Testing properties of directed graphs: Acyclicity and connectivity, Random Structures Algorithms, 20 (2002), pp. 184-205.
7. A. BOGDANOV, K. OBATA, AND L. TREVISAN, A lower bound for testing 3-colorability in bounded-degree graphs, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, Los Alamitos, CA, 2002, pp. 93-102.
8. C. BORGS, J. CHAYES, L. LOVÁSZ, 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 (STOC), ACM, New York, 2006, pp. 261-270.
9. A. CZUMAJ AND C. SOHLER, Abstract combinatorial programs and egfficient property testers, SIAM J. Comput., 34 (2005), pp. 580-615.
10. A. CZUMAJ AND C. SOHLER, Sublinear-time algorithms, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 89 (2006), pp. 23-47.
11. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
12. J. R. GILBERT, J. P. HUTCHINSON, AND R. E. TARJAN, A separator theorem for graphs of bounded genus, J. Algorithms, 5 (1984), pp. 391-407.
13. O. GOLDREICH, Property testing in massive graphs, in Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Resende, eds., Kluwer Academic Publishers, Dordrecht, 2002, pp. 123-147.
14. O. GOLDREICH AND D. RON, A sublinear bipartiteness tester for bounded degree graphs, Combinatorica, 19 (1999), pp. 335-373.
15. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
16. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London, UK, 1980.
17. R. KUMAR AND R. RUBINFELD, Sublinear time algorithms, SIGACT News, 34 (2003), pp. 57-67.
18. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
19. J. L. RAMIREZ-ALFONSIN AND B. A. REED, EDS., Perfect Graphs, John Wiley and Sons, New York, 2001.
20. 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, 2001, pp. 597-649.