Combinatorial Generation by Fusing Loopless Algorithms

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to produce a new loopless algorithm that solves the original problem. We demonstrate this method with two new loopless algorithms, MIXPAR and MULTPERM. MIXPAR generates well-formed parenthesis strings containing two different types of parentheses. MULTPERM generates multiset permutations in linear space using only arrays; it is simpler and more efficient than the recent algorithm of Korsh and LaFollette (2004).

• Type: Conference
• Year: 2006
• Where: CATS
• Authors: Tadao Takaoka, Stephen Violich
• Keywords: CATS 2006, CATS 2007, Combinatorial Generation Problems, Loopless Algorithms, Well-formed Parenthesis Strings