An O(1) time algorithm for generating multiset permutations

DOI10.1007/3-540-46632-0_25MaRDI QIDQ4511229zbMATH OpenFDO

Authors Tadao Takaoka

Publication date 30 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46632-0_25

zbMATH Keywords

multiset permutations

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
• scientific article; zbMATH DE number 7051269
• A new algorithm for generation of permutations
• scientific article; zbMATH DE number 3864523
• A loopless algorithm for generating the permutations of a multiset

Cited in

(13)

• Gray codes, loopless algorithm and partitions
• The coolest way to generate combinations
• A loopless algorithm for generating the permutations of a multiset
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Constant time generation of derangements
• Flip-swap languages in binary reflected Gray code order
• On O(1) time algorithms for combinatorial generation
• Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
• A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
• scientific article; zbMATH DE number 7051269 (Why is no real title available?)
• Binary bubble languages and cool-lex order
• Loop-free Gray code algorithms for the set of compositions
• Generating Gray codes for weak orders in constant amortized time

This page was built for publication: An \(O(1)\) time algorithm for generating multiset permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511229)