Tight bounds for testing bipartiteness in general graphs

SIAM Journal on Computing

Volumn 33, Issue 6, 2004, Pages 1441-1483

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

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bipartiteness; Property testing; Randomized algorithms

Indexed keywords

ALGORITHMS; DECISION MAKING; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; SET THEORY;

BIPARTITENESS; PROPERTY TESTING; RANDOMIZED ALGORITHMS; VERTEX-PAIR QUERIES;

GRAPH THEORY;

EID: 11144271571     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703436424     Document Type: Article

References (22)

1. N. ALON, Testing subgraphs of large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370.
2. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
3. N. ALON AND M. KRIVELEVICH, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227.
4. N. ALON AND A. SHAPIRA, Testing subgraph in directed graphs, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM, New York, 2003, pp. 700-709.
5. N. ALON AND J. H. SPENCER, The Probabilistic Method, John Wiley and Sons, New York, 1992.
6. M. 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 Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 93-102.
8. A. BOGDANOV AND L. TREVISAN, Lower Bounds for Testing Bipartiteness in Dense Graphs, Tech. report TR02-064, Electronic Colloquium on Computational Complexity (ECCC), 2002. Available from http://www.eccc.uni-trier.de/eccc/.
9. B. BOLLOBAS, P. ERDOS, M. SIMONOVITZ, AND E. SZEMEREDI, Extremal graphs without large forbidden subgraphs, Ann. Discrete Math., 3 (1978), pp. 29-41.
10. A. CZUMAJ AND C. SOHLER, Abstract combinatorial programs and efficient property testers, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 83-92.
11. U. FEIGE, On sums of independent random variables with unbounded variance, and estimating the average degree in a graph, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 594-603.
12. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
13. O. GOLDREICH AND D. RON, A sublinear bipartite tester for bounded degree graphs, Combinatorica, 19 (1999), pp. 335-373.
14. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
15. O. GOLDREICH AND D. RON, On Estimating the Average Degree of a Graph, Tech. report TR04-013, Electronic Colloquium on Computational Complexity (ECCC), 2004. Available from http://www.eccc.uni-trier.de/eccc/.
16. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
17. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Explicit expanders and the Ramanujan conjectures, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM, New York, 1986, pp. 240-246.
18. G. A. MARGULIS, Explicit constructions of expanders, Problemy Peredachi Informatsii, 9 (1973), pp. 71-80 (in Russian).
19. M. MIHAIL, Conductance and convergence of Markov chains: A combinatorial treatment of expanders, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 526-531.
20. M. PARNAS AND D. RON, Testing the diameter of graphs, Random Structures Algorithms, 20 (2002), pp. 165-183.
21. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
22. A. YAO, Probabilistic computation: Towards a unified measure of complexity, in Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1977, pp. 222-227.