✦ LIBER ✦

Constant Time Generation of Rooted Trees

✍ Scribed by Beyer, Terry; Hedetniemi, Sandra Mitchell

Book ID: 118174067
Publisher: Society for Industrial and Applied Mathematics
Year: 1980
Tongue: English
Weight: 719 KB
Volume: 9
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0209055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constant Time Generation of Free Trees

✍ Wright, Robert Alan; Richmond, Bruce; Odlyzko, Andrew; McKay, Brendan D. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 885 KB

Constant time per edge is optimal on roo

Constant time per edge is optimal on rooted tree networks

✍ Michael Mitzenmacher 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 356 KB

Parallel Shortcutting of Rooted Trees

✍ Mikkel Thorup 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 305 KB

First it is shown that for any rooted tree T with n vertices, and parameter m G n, there is a ''shortcutting'' set S of at most m arcs from the transitive closure Ž . T\* of T such for any ¨, w g T \*, there is a dipath in T j S from ¨to w of length Ž Ž .. Ž O ␣ m, n . An equivalent result has been

Iterated Joining of Rooted Trees

✍ Paolo Dulio, Virgilio Pannone 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 342 KB

Constant time generation of derangements

✍ James F. Korsh; Paul S. LaFollette 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Denumerations of rooted trees and multis

Denumerations of rooted trees and multisets

✍ N.G. de Bruijn 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 560 KB