𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotics of trees with a prescribed degree sequence and applications

✍ Scribed by Nicolas Broutin; Jean-François Marckert

Book ID
115561926
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
334 KB
Volume
44
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ranking and unranking of non-regular tre
Ranking and unranking of non-regular trees with a prescribed branching sequence
✍ Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Ordered trees are called non-regular trees with a prescribed branching sequence (or nonregular trees for short) if their internal nodes have a pre-specified degree sequence in preorder list. This article presents two main results. First, we develop a simple algorithm to generate all non-regular tree

Multiset Permutations and Loopless Gener
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
✍ James F. Korsh; Paul LaFollette 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An ordered tree with specified degree sequence and n internal nodes has a i Ž . nodes of degree i, where a s 1 q Ý i y 1 a and n s Ý a . This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for gener