Comparing the strength of query types in property testing: The case of k-colorability-Reference-Cited by-同舟云学术

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

Published:2012-09-21 Issue:1 Volume:22 Page:89-135
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Ben-Eliezer Ido,Kaufman Tali,Krivelevich Michael,Ron Dana

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-012-0048-2.pdf

Reference23 articles.

1. Alon N., Fischer E., Krivelevich M., Szegedy M. (2000) Efficient Testing of Large Graphs. Combinatorica 20: 451–476

2. N. Alon, E. Fischer, I. Newman & A. Shapira (2007). A combinatorial characterization of the testable graph properties: it’s all about regularity. In Proceedings of the 38th ACM STOC, 251–260.

3. N. Alon, T. Kaufman, M. Krivelevich & D. Ron (2006). Testing triangle freeness in general graphs. In Proceedings of the 17th ACM-SIAM SODA, 279–288.

4. Alon N., Krivelevich M. (2002) Testing k-colorability. SIAM Journal on Discrete Math 15(2): 211–227

5. N. Alon & J. Spencer (2000). The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Edge Estimation with Independent Set Oracles;ACM Transactions on Algorithms;2020-10-31

2. Testing Bipartiteness of Graphs in Sublinear Time;Encyclopedia of Algorithms;2016

3. Testing Bipartiteness of Graphs in Sublinear Time;Encyclopedia of Algorithms;2015