A lower bound for testing 3-colorability on bounded-degree graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 93-102

  Bogdanov, Andrej ^a   Obata, Kenji ^a   Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

BOUNDED DEGREE MODEL; COLORABLE GRAPHS; ERROR TESTERS;

GRAPH THEORY;

EID: 0036957224     PISSN: 02725428     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. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 656-666, 1999.
2. N. Alon, E. Fischer, I. Newton, and M. Szegedy. Regular languages are testable with a constant number of queries. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 645-655, 1999.
3. N. Alon and M. Krivelevich. Testing k-colorability. SIAM J. on Discrete Mathematics. To appear.
4. M. Bender and D. Ron. Testing acyclicity of directed graphs in sublinear time. In Proc. of ICALP'00, 2000.
5. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. In Proc. of ICALP'00, 2000.
6. P. Erdõs. On the circuits and subgraphs of chromatic graphs. Mathematika, 9:170-175, 1962.
7. A. Frieze and M. Jerrum. Improved approximation algorithms for Max k Cut and Max Bisection. Algorithmica, 18:61-77, 1997.
8. A. Frieze and S. Kannan. Quick approximation to matrices and applications. Combinatorica, 19:175-220, 1999.
9. O. Gabber and Z. Galil. Explicit construction of linear sized superconcentrators. Journal of Computer and System Sciences, 22:407-425, 1981.
10. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connections to learning and approximation. Journal of the ACM, 45:653-750, 1998.
11. O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 289-298, 1997.
12. O. Goldreich and D. Ron. A sublinear bipartitness tester for bounded degree graphs. In Proceedings of the 30th ACM Symposium on Theory of Computing, pages 406-415, 1998.
13. J. Håstad. Some optimal inapproximability results. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 1-10, 1997.
14. G.A. Margulis. Explicit construction of a concentrator. Problems of Information Transmission, 9:71-80, 1973.
15. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991. Preliminary version in Proc. of STOC'88.
16. E. Petrank. The hardness of approximations: Gap location. Computational Complexity, 4:133-157, 1994. Preliminary version in Proc. of ISTCS'93.
17. A. Polishchuk and D.A. Spielman. Nearly-linear size holographic proofs. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 194-203, 1994.
18. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 453-461, 2001.