References
- Random Structures and Algorithms v.5 Random Recursive Forests K.T.Balinska;L.V.Quintas;J.Szymanski
- Graphs and hypergraphs C.Berge
- Acta Informatica v.26 Applications of the theory of records in the study of random trees L.Devroye
- Operations Research v.32 Two probability models of pyramids or chain letter schemes demonstrating that their promotional calims are unreliable J.Gastwirth;P.Bhattacharya
- Random Structures and Algorithms v.3 Asymptotic joint formality of outdegrees of nodes in random recursive trees H.Mahmoud;R.Smythe
- London Math. Soc. Lecture Notes v.13 The distance between nodes in recursive trees J.Moon
- J. Applied Prob. v.19 On the number of terminal vertices in certain random trees with on application to stemma construction in philology D.Najock;C.Heyde
- Theor. Probability and Math. Statist. v.51 A survey of recursive trees R.T.Smythe;H.M.Mahmoud
- Korean J. Comput. & Appl. Math. v.6 no.3 An optimal algorithm for finding depth-first spanning tree on permutation graphs Sukumar Mondal;Modhumangal Pal;Tapan K.Pal
- Korean J. Comput. & Appl. Math. v.5 no.2 A new parallel algorithm for rooting a tree Taenam Kim;Dukwan Oh;Eunki Lim