On the benefits of adaptivity in property testing of dense graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 525-539

  Gonen, Mira ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; QUERY PROCESSING;

DENSE GRAPHS MODELS; PROPERTY TESTING;

GRAPH THEORY;

EID: 38049041616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_38     Document Type: Conference Paper

References (18)

1. Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica 20, 451-476 (2000)
2. Alon, N., Krivelevich, M.: Testing k-colorability. SIAM J. on Discrete Mathematics 15, 211-227 (2002)
3. Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (2000)
4. Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: 3CNF properties are hard to test. In: Proc. 35th Symposium on the Theory of Computing (STOC), pp. 345-354 (2003)
5. Bogdanov, A., Trevisan, L.: Lower bounds for testing bipartiteness in dense graphs. In: Proc. 19th IEEE Symp. Computational Complexity Conference, pp. 75-81 (2004)
6. Ergun, F., Kannan, S., Kumar, S.R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. Journal of Computer and Systems Science 60(3), 717-751 (2000)
7. Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science 75, 97-126 (2001)
8. Fischer, E.: On the strength of comparisons in property testing. Information and Computation 189, 107-116 (2004)
9. Goldreich, O.: Combinatorial property testing - a survey. In: Randomization Methods in Algorithm Design, pp. 45-60 (1998)
10. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connections to learning and approximation. Journal of the ACM 45, 653-750 (1998)
11. Goldreich, O., Ron, D.: A sublinear bipartite tester for bounded degree graphs. Combinatorica 19(3), 335-373 (1999)
12. Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302-343 (2002)
13. Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Structures and Algorithms 23(1), 23-57 (2003)
14. Gonen, M., Ron, D.: On the benefits of adaptivity in property testing of dense graphs. Available (2007) from http://www.eng.tau.ac.il/~danar
15. Janson, S.: Poisson approximaton for large deviations. Random Structures and Algorithms 1(2), 221-229 (1990)
16. Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing 33(6), 1441-1483 (2004)
17. Raskhodnikova, S., Smith, A.: A note on adaptivity in testing properties of bounded degree graphs. Technical Report TR06-089, Electronic Colloquium on Computational Complexity (ECCC), Available (2006) from http://www.eccc.uni- trier.de/eccc/
18. Ron, D.: Property testing. In Handbook on Randomization II, 597-649 (2001)