Publisher
Springer Berlin Heidelberg
Reference60 articles.
1. Alon, N.: Testing subgraphs of large graphs. Random Structures and Algorithms 21, 359–370 (2002)
2. Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient Testing of Large Graphs. Combinatorica 20, 451–476 (2000)
3. Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity. In: 38th STOC, pp. 251–260 (2006)
4. Alon, N., Krivelevich, M.: Testing k-Colorability. SIAM Journal on Disc. Math. 15(2), 211–227 (2002)
5. Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle freeness in general graphs. In: 17th SODA, pp. 279–288 (2006)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献