Author:
Chazelle Bernard,Rubinfeld Ronitt,Trevisan Luca
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Alon, N., Dar, S., Parnas, M., Ron, D., Testing of clustering, Proc. FOCS, 2000.
2. Chazelle, B., A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, 47 (2000), 1028–1047.
3. Chazelle, B., The Discrepancy Method: Randomness and Complexity, Cambridge University Press, 2000.
4. Eppstein, D., Representing all minimum spanning trees with applications to counting and generation, Tech. Rep. 95-50, ICS, UCI, 1995.
5. Fredman, M.L., Willard, D.E. Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. and System Sci., 48 (1993), 424–436.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Contemplations on Testing Graph Properties;Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation;2011
2. Introduction to Testing Graph Properties;Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation;2011
3. Testing Outerplanarity of Bounded Degree Graphs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2010
4. Introduction to Testing Graph Properties;Property Testing;2010
5. A sublinear-time approximation scheme for bin packing;Theoretical Computer Science;2009-11