Combinatorial generation by fusing loopless algorithms

Authors:
Tadao Takaoka;Stephen Violich
Affiliations:
Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand;Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand
Venue:
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Year:
2006

Citing 7
Cited 1

Combinatorics for computer science

Combinatorics for computer science
Generating multiset permutations in constant time

Journal of Algorithms
A Survey of Combinatorial Gray Codes

SIAM Review
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
Algorithm 115: Perm

Communications of the ACM
A loopless algorithm for generating the permutations of a multiset

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Generating balanced parentheses and binary trees by prefix shifts

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loop-less algorithms can be fused to produce a new loop-less 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).