Comparing the strength of query types in property testing: The case of testing k-colorability

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1213-1222

  Ben Eliezer, Ido ^a   Kaufman, Tali ^b   Krivelevich, Michael ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE DEGREE; CASE STUDIES; ERROR ALGORITHMS; LOWER BOUNDS; NEW TOOLS; PROPERTY TESTING; QUERY COMPLEXITY; QUERY MODELS; QUERY TYPES;

CONTROL THEORY;

GRAPH THEORY;

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

References (18)

1. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. Combinatorica, 20: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. In Proc. of the 38 ACM STOC, pages 251-260, 2007.
3. N. Alon, T. Kaufman, M. Krivelevich, and D. Ron. Testing triangle freeness in general graphs. In Proceedings of the 17th Symposium on Discrete Algorithms (SODA'06), pages 279-288, 2006.
4. N. Alon and M. Krivelevich. Testing k-colorability. SIAM Journal on Discrete Math, 15(2):211-227, 2002.
5. N. Alon and J. Spencer. The probablistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
6. I. Ben-Eliezer, T. Kaufman, M. Krivelevich, and D. Ron. Comparing the strength of query types in property testing: The case of testing k-colorability. Manuscript, available from http://www.eng.tau.ac.il/ ~danar/papers.html, 2007.
7. A. Bogdanov, K. Obata, and L. Trevisan. A lower bound for testing 3-colorability in bounded degree graphs. In Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science, pages 93-102, 2002.
8. A. Czumaj, A. Shapira, and C. Sohler. Testing hereditary properties of non-expanding boundeddegree graphs. Manuscript, 2007.
9. D, Dn and F. Hwang. Combinatorial group testing and its applications. World Scientific, 1993.
10. R. Duke and V. Ftödl. On graphs with small subgraphs of large chromatic number. Graphs Combin, 1:91-96, 1985.
11. E. Fischer. The art of uninformed decisions: A primer to property testing. The Bulletin of the European Association for Theoretical Computer Science, 75:97-126, 2001.
12. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998.
13. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, 32(2):302-343, 2002.
14. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, 33(6):1441-1483, 2004.
15. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2):165-183, 2002.
16. D. Ron. Property testing. In Handbook of Randomized Computing, Volume II, Chapter 15, pages 597-649. Edited by S. Rajasekaran, P. M. Pardalos, J.H. Reif and J. Rolim, Kluwer Academic Publishers.
17. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
18. D. West. Introduction to Graph 'Theory. Prentice Hall, 2000.