Author:
Rödl Vojtěch,Schacht Mathias
Publisher
Springer Berlin Heidelberg
Reference49 articles.
1. N. Alon, A. Coja-Oghlan, H. Hàn, M. Kang, V. Rödl and M. Schacht, Quasirandomness and algorithmic regularity for graphs with general degree distributions, SIAM J. Comput, to appear.
2. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica, 20 (2000), no. 4, 451–476.
3. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput, 37 (2008), no. 6, 1703–1727.
4. N. Alon and A. Shapira, Every monotone graph property is testable, SIAM J. Comput, 38 (2008), no. 2, 505–522.
5. T. Austin and T. Tao, On the testability and repair of hereditary hypergraph properties, submitted.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献