Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Statistics and Probability
Reference14 articles.
1. Abdel-Wahab, H., Stoica, I., Sultan, F.: A simple algorithm for computing minimum spanning trees in the internet. Inform. Comput. Sci. 101, 47–69 (1997)
2. Alexander, K.: The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees. Ann. Appl. Probab. 6, 466–494 (1996)
3. Alon, N., Spencer, J.: The Probabilistic Method. Wiley, New York (2008)
4. Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Proc. Camb. Philos. Soc. 55, 299–327 (1959)
5. Chatterjee, S., Sen, S.: Minimal spanning trees and Stein’s method. Ann. Appl. Probab. 27, 1588–1645 (2017)