𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating Multiset Permutations in Constant Time

✍ Scribed by James Korsh; Seymour Lipschutz

Book ID
102579154
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
281 KB
Volume
25
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

An algorithm is presented that generates multiset permutations taking constant time between each permutation.

πŸ“œ SIMILAR VOLUMES

A loopless algorithm for generating the
A loopless algorithm for generating the permutations of a multiset
✍ Vincent Vajnovszki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 372 KB

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shu e on trajectories (deΓΏned previou

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