On testable properties in bounded degree graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 494-501

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

BOUNDED DEGREE; BOUNDED DEGREE GRAPHS; GRAPH PROPERTIES; HEREDITARY PROPERTY; INTERVAL GRAPH; SPECIAL CLASS; TIME INDEPENDENTS; VERTEX REMOVAL;

GRAPH THEORY;

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

References (28)

1. N. Alon, E. Fischer, M. Krivelevich, M. Szegedy. Efficient testing of large graphs. Combinatorica, 20(4): 451-476, 2000.
2. N. Alon, E. Fischer, I. Newman, and A. Shapira. A combinatorial characterization of the testable graph properties: it's all about regularity. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 251-260, 2006.
3. N. Alon, T. Kaufman, M. Krivelevich, and D. Ron. Testing triangle-freeness in general graphs. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 279-288, 2006.
4. N. Alon, P. Seymour, and R. Thomas. A separator theorem for graphs with an excluded minor and its applications. Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 293-299, 1990.
5. N. Alon and A. Shapira. Every monotone graph property is testable. Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 128-137, 2005.
6. N. Alon and A. Shapira. A characterization of the (natural) graph properties testable with one-sided error. Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 429-438, 2005.
7. N. Alon and A. Shapira. Homomorphisms in graph property testing - A survey. Electronic Colloquium on Computational Complexity (ECCC), Report No. 85, 2005.
8. M. A. Bender and D. Ron. Testing properties of directed graphs: acyclicity and connectivity. Random Structures and Algorithms, 20(2): 184-205, 2002.
9. A. Bogdanov, K. Obata, and L. Trevisan. A lower bound for testing 3-colorability in bounded-degree graphs. Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 93-102, 2002.
10. C. Borgs, J. Chayes, L. Lovász, V. T. Sos, B. Szegedy, and K. Vesztergombi. Graph limits and parameter testing. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 261-270, 2006.
11. A. Czumaj and C. Sohler. Abstract combinatorial programs and efficient property testers. SIAM Journal on Computing, 34(3): 580-615, 2005.
12. A. Czumaj and C. Sohler. Sublinear-time algorithms Bulletin of the EATCS, 89: 23-47, June 2006.
13. E. Fischer. The art of uninformed decisions: A primer to property testing. Bulletin of the EATCS, 75: 97-126, October 2001.
14. J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan. A separator theorem for graphs of bounded genus. Journal of Algorithms, 5: 391-407, 1984.
15. O. Goldreich. Combinatorial property testing (a survey). In P. Pardalos, S. Rajasekaran, and J. Rolim, editors, Proceedings of the DIMACS Workshop on Randomization Methods in Algorithm Design, volume 43 of DIMACS, Series in Discrete Mathetaics and Theoretical Computer Science, pp. 45-59, 1997. American Mathematical Society, Providence, RI, 1999.
16. O. Goldreich. Property testing in massive graphs. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of massive data sets, pp. 123-147. Kluwer Academic Publishers, 2002.
17. O. Goldreich. Contemplations on testing graph properties. August 2005.
18. O. Goldreich and D. Ron. A sublinear bipartiteness tester for bounded degree graphs. Combinatorica, 19(3):335-373, 1999.
19. O. Goldreich and D. Ron. On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC), Report No. 7, 2000.
20. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, 32(2): 302-343, 2002.
21. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
22. R. Kumar and R. Rubinfeld. Sublinear time algorithms. SIGACT News, 34: 57-67, 2003.
23. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, 33(6): 1441-1483, 2004.
24. R. J. Lipton and R. E. Tarjan A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 36(2):177-189, 1979.
25. L. Lovász and B. Szegedy. Graph limits and testing hereditary graph properties. Technical Report, MSR-TR- 2005-110, Microsoft Research, August 2005.
26. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2): 165-183, 2002.
27. J. L. Ramirez-Alfonsin and B. A. Reed, editors. Perfect Graphs. Wiley and Sons, 2001.
28. D. Ron. Property testing. In P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, editors, Handobook of Randomized Algorithms, volume II, pp. 597-649. Kluwer Academic Publishers, 2001.