✦ LIBER ✦

Denumerations of rooted trees and multisets

✍ Scribed by N.G. de Bruijn

Book ID: 104182765
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 560 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90097-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vector lattices and rooted trees

✍ M. F. Hobart; J. D. H. Smith 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 337 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

Lassoing and Corralling Rooted Phylogene

Lassoing and Corralling Rooted Phylogenetic Trees

✍ Huber, Katharina T.; Popescu, Andrei-Alin 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 788 KB

Embeddings and Other Mappings of Rooted

Embeddings and Other Mappings of Rooted Trees Into Complete Trees

✍ Nicholas Georgiou 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 450 KB

Constant Time Generation of Rooted Trees

✍ Beyer, Terry; Hedetniemi, Sandra Mitchell 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 719 KB