Author:
Broutin Nicolas,Devroye Luc,McLeish Erin
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference28 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)
2. Aldous, D.: A random tree model associated with random graphs. Random Struct. Algorithms 4, 383–402 (1990)
3. Aldous, D., Steele, J.M.: Asymptotics for euclidean minimum spanning trees on random points. Probab. Theory Relat. Fields 92, 247–258 (1992)
4. Cambridge Studies in Advanced Mathematics;B. Bollobás,2001
5. Bollobás, B., Simon, I.: On the expected behavior of disjoint set union algorithms. In: STOC ’85: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 224–231. ACM, New York (1985)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献