Publisher
Springer International Publishing
Reference12 articles.
1. Angel, O., Flaxman, A.D., Wilson, D.B.: A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. arXiv:0810.4908v2 [math.PR] (2011)
2. Cooper, C., Frieze, A., Ince, N., Janson, S., Spencer, J.: On the length of a random minimum spanning tree. Comb. Probab. Comput. 25(1), 89–107 (2016)
3. Frieze, A.: On the value of a random MST problem. Discrete Appl. Math. 10, 47–56 (1985)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)
5. Gimadi, E.K., Glebov, N.I., Perepelitsa, V.A.: Algorithms with estimates for discrete optimization problems. Problemy Kibernetiki 31, 35–42 (1975) (in Russian)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献