Publication:3122913
From MaRDI portal
DOI<187::AID-RSA10>3.0.CO;2-6 10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.0.CO;2-6zbMath0872.60008MaRDI QIDQ3122913
Theodore Johnson, Colin J. H. McDiarmid, Harold S. Stone
Publication date: 1 October 1997
05C05: Trees
60C05: Combinatorial probability
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Invasion percolation on the Poisson-weighted infinite tree, Note on the structure of Kruskal's algorithm
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- The continuum random tree. I
- Asymptotic fringe distributions for general families of random trees
- On random minimum length spanning trees
- On the value of a random minimum spanning tree problem
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- On Finding the Expected Length of a Random Minimal Tree
- A random tree model associated with random graphs
- Note on the heights of random recursive trees and random m‐ary search trees
- Random recursive forests
- Components of Random Forests
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph