✦ LIBER ✦
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
✍ Scribed by James F. Korsh; Paul LaFollette
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 131 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
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 generating multiset Ž . permutations. When a s N, a s k y 1 N q 1, and all other a 's are 0, all N k 0 i node k-ary trees are generated.