A loopless algorithm for generating the permutations of a multiset

DOI10.1016/S0304-3975(03)00228-7zbMath1081.68064MaRDI QIDQ1885026

Vicentiu Vajnovszki

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Gray codesLoopless generating algorithmsMultiset permutationsShuffle combinatorial objects

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (15)

A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ Gray code for permutations with a fixed number of cycles ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions ⋮ Binary bubble languages and cool-lex order ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Hamiltonian paths for involutions in the square of a Cayley graph ⋮ Gray codes for signed involutions ⋮ Gray code for derangements ⋮ Gray codes, loopless algorithm and partitions ⋮ The coolest way to generate combinations ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A loopless algorithm for generating the permutations of a multiset