✦ LIBER ✦

Gray code for permutations with a fixed number of cycles

✍ Scribed by Jean-Luc Baril

Book ID: 108113729
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 200 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Descent classes of permutations with a g

Descent classes of permutations with a given number of fixed points

✍ Jacques Désarménien; Michelle L Wachs 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 781 KB

On two classes of permutations with numb

On two classes of permutations with number-theoretic conditions on the lengths of the cycles

✍ A. I. Pavlov 📂 Article 📅 1997 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 372 KB

Low-complexity algorithms for sequencing

Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

✍ Jack A.A. van der Veen; Shuzhong Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Limit theorems for Markov random walks w

Limit theorems for Markov random walks with a fixed number of certain transitions

✍ V. V. Chichagov 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 359 KB

AnO (n)-algorithm for LP-knapsacks with

AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints

✍ P. Brucker 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 401 KB