FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION

DOI10.1142/S0129054107004681zbMath1112.68132MaRDI QIDQ3434277

Stephen Violich, Tadao Takaoka

Publication date: 25 April 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

fusingmultiset permutationsloopless algorithmsparenthesis strings

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for generating subsets of fixed size with a strong minimal change property
• A loopless algorithm for generating the permutations of a multiset
• A loop-free algorithm for generating the linear extensions of a poset
• On O(1) Time Algorithms for Combinatorial Generation
• Generating Linear Extensions Fast
• Generating Multiset Permutations in Constant Time
• A Survey of Combinatorial Gray Codes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION