✦ LIBER ✦

A simplified loop-free algorithm for generating permutations

✍ Scribed by Nachum Dershowitz

Publisher: Springer Netherlands
Year: 1975
Tongue: English
Weight: 350 KB
Volume: 15
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932689

No coin nor oath required. For personal study only.

📜 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

A permutation-generating algorithm

✍ C. Zhou 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A CAT algorithm for generating permutati

A CAT algorithm for generating permutations with a fixed number of inversions

✍ Scott Effler; Frank Ruskey 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.

A new algorithm for generation of permut

A new algorithm for generation of permutations

✍ Shmuel Zaks 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 381 KB

An Optimal Systolic Algorithm for Genera

An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order

✍ S.G. Akl; H. Meijer; I. Stojmenovic 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A systolic algorithm is described for generating all permutations of \(n\) elements in lexicographic order. The algorithm is designed to be executed on a linear array of \(n\) processors, each having constant size memory, and each being responsible for producing one element of a given permutation. T

An optimal parallel algorithm for genera

An optimal parallel algorithm for generating permutations in minimal change order

✍ Jong-Chuang Tsay; Wei-Ping Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processo