✦ LIBER ✦

Iterated Joining of Rooted Trees

✍ Scribed by Paolo Dulio, Virgilio Pannone

Book ID: 120788721
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 342 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1178-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rooted trees and iterated wreath product

Rooted trees and iterated wreath products of cyclic groups

✍ R.C. Orellana; M.E. Orrison; D.N. Rockmore 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 199 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

Denumerations of rooted trees and multis

Denumerations of rooted trees and multisets

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

Reconstruction of rooted trees from subt

Reconstruction of rooted trees from subtrees

✍ Meei Pyng Ng; Nicholas C. Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Some properties of plane rooted trees

✍ I. V. Konoval'tsev; E. P. Lipatov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 340 KB

Optimal Labellings of Rooted Directed Tr

Optimal Labellings of Rooted Directed Trees

✍ Jia-yu Shao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 200 KB

We consider an optimal labelling problem for a rooted directed tree abbreviated . as ''RDT'' which is motivated by certain scheduling problem. We obtain several necessary and sufficient conditions for the optimal labellings of a RDT and give a polynomially bounded algorithm for constructing the opti