A loopless algorithm for generating the permutations of a multiset
From MaRDI portal
Publication:1885026
DOI10.1016/S0304-3975(03)00228-7zbMath1081.68064MaRDI QIDQ1885026
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
68W05: Nonnumerical algorithms
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
Related Items
Hamiltonian paths for involutions in the square of a Cayley graph, Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions, Binary bubble languages and cool-lex order, Loop-free Gray code algorithms for the set of compositions, Gray codes for signed involutions, Generating Gray codes for weak orders in constant amortized time, A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words, Gray code for permutations with a fixed number of cycles, Combinatorial Gray codes for classes of pattern avoiding permutations, More restrictive Gray codes for some classes of pattern avoiding permutations, Gray codes, loopless algorithm and partitions, The coolest way to generate combinations, Gray code for derangements, Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions, FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the loopless generation of binary tree sequences
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Shuffle on trajectories: Syntactic constraints
- Generating permutations of a bag by interchanges
- A loop-free algorithm for generating the linear extensions of a poset
- On Generating the N-ary Reflected Gray Codes
- Efficient generation of the binary reflected gray code and its applications
- Generating Multiset Permutations in Constant Time
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
