Generating permutations with given ups and downs
From MaRDI portal
Publication:1186163
DOI10.1016/0166-218X(92)90204-NzbMath0790.05001OpenAlexW2056243510MaRDI QIDQ1186163
Frank Ruskey, Dominique Roelants van Baronaigien
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)90204-n
Related Items (8)
A multi-stack method for the fast generation of permutations with minimal length increasing subsequences ⋮ Gray code for permutations with a fixed number of cycles ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ On the frequencies of patterns of rises and falls ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Gray code for derangements ⋮ Gray codes, loopless algorithm and partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating alternating permutations lexicographically
- Transposition generation of alternating permutations
- Generating t-ary trees in A-order
- A method and two algorithms on the theory of partitions
- A simple solution of Simon Newcomb's problem
- Enumeration of permutations with prescribed up-down and inversion sequences
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- A Unified Setting for Selection Algorithms (II)
- Generating the Linear Extensions of Certain Posets by Transpositions
- A simplified loop-free algorithm for generating permutations
- Generating Trees and Other Combinatorial Objects Lexicographically
- On the generation of all topological sortings
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
This page was built for publication: Generating permutations with given ups and downs
