Tight bounds for testing bipartiteness in general graphs

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

Volumn 2764, Issue , 2003, Pages 341-353

  Kaufman, Tali ^a   Krivelevich, Michael ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; OPTIMIZATION;

BIPARTITENESS; BOUNDED DEGREE GRAPHS; DENSE GRAPHS; GENERAL GRAPH; LOWER BOUNDS; TIGHT BOUND;

APPROXIMATION ALGORITHMS;

EID: 26944436398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_29     Document Type: Article

References (17)

1. N. Alon. Testing subgraphs of large graphs. Random Structures and Algorithms, 21:359-370, 2002.
2. N. Alon, E. Fischer, M. Krivelevich, and M Szegedy. Efficient testing of large graphs. Combinatorica, 20:451-476, 2000.
3. N. Alon and M. Krivelevich. Testing k-colorability. SIAM Journal on Discrete Math, 15(2):211-227, 2002.
4. N. Alon and A. Shapira. Testing subgraph in directed graphs. Submitted, 2002.
5. M. Bender and D. Ron. Testing properties of directed graphs: Acyclicity and connectivity. Random Structures and Algorithms, pages 184-205, 2002.
6. A. Bogdanov, Kenji 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.
7. A. Bogdanov and L. Trevisan. Lower bounds for testing bipartiteness in dense graphs. Submitted, 2002.
8. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. In Proceedings of the Thirty-Seventh Annual Symposium on Foundations of Computer Science, pages 339-348, 1996.
9. O. Goldreich and D. Ron. A sublinear bipartite tester for bounded degree graphs. Combinatorica, 19(3):335-373, 1999.
10. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, pages 302-343, 2002.
11. O. Goldreich and L. Trevisan. Three theorems regarding testing graph properties. In Proceedings of the Forty-Second Annual Symposium on Foundations of Computer Science, pages 460-469, 2001.
12. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. http://www.eng.tau.ac.il/~danar/papers.html.
13. A. Lubotzky, R. Phillips, and P. Sarnak. Explicit expanders and the ramanujan conjectures. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 240-246, 1986.
14. Gregory A. Margulis. Explicit constructions of expanders. Problemy Peredachi Informatsii, 9(4):71-80, 1973. expanders construction.
15. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2):165-183, 2002.
16. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
17. A.C. Yao. Probabilistic computation, towards a unified measure of complexity. In Proceedings of the Eighteenth Annual Symposium on Foundations of Computer Science, pages 222-227, 1977.