✦ LIBER ✦

Generating alternating permutations lexicographically

✍ Scribed by Bruce Bauslaugh; Frank Ruskey

Book ID: 105402714
Publisher: Springer Netherlands
Year: 1990
Tongue: English
Weight: 465 KB
Volume: 30
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932127

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lexicographic permutations with restrict

Lexicographic permutations with restrictions

✍ Donald E Knuth 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 727 KB

A systolic design for generating permuta

A systolic design for generating permutations in lexicographic order

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

Generating stable permutations

✍ A. Panayotopoulos 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

A permutation 0 = xlx2. • .xn on [n] = {1, 2, ..., n} is called stable when: For instance, the permutation o = 72631485 is a stable permutation (s.p.). This term is derived from the stability concept of the graphs, which has been used by Berge [1, p. 260] in the classic problem of eight queens. Th

Transposition generation of alternating

Transposition generation of alternating permutations

✍ Frank Ruskey 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 383 KB

Generating words lexicographically: An a

Generating words lexicographically: An average-case analysis

✍ Rainer Kemp 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 774 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