A fast algorithm to generate necklaces with fixed content

Authors:
Joe Sawada
Affiliations:
Department of Computer Science, University of Toronto, 10 King's College Road, Toronto, Ont. Canada M5S 1A4
Venue:
Theoretical Computer Science
Year:
2003

Citing 5
Cited 8

An algorithm for generating necklaces of beads in two colors

Discrete Mathematics
A Gray Code for Necklaces of Fixed Density

SIAM Journal on Discrete Mathematics
An Efficient Algorithm for Generating Necklaces with Fixed Density

SIAM Journal on Computing
Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2)

Journal of Algorithms
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams

SIAM Journal on Discrete Mathematics

A loopless Gray code for rooted trees

ACM Transactions on Algorithms (TALG)
Efficient iteration in admissible combinatorial classes

Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Loopless generation of multiset permutations using a constant number of variables by prefix shifts

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Solving necklace constraint problems

Journal of Algorithms
Solving Necklace Constraint Problems

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The relevant prefixes of coloured Motzkin walks: An average case analysis

Theoretical Computer Science
Generating bracelets with fixed content

Theoretical Computer Science
On the degree sequences of uniform hypergraphs

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	5.23

Visualization

Abstract

We develop a fast algorithm for listing all necklaces with fixed content. By fixed content, we mean the number of occurrences of each alphabet symbol is fixed. Initially, we construct a simple but inefficient algorithm by making some basic modifications to a recursive necklace generation algorithm. We then improve it by using two classic combinatorial optimization techniques. An analysis using straight forward bounding techniques is used to prove that the algorithm runs in constant amortized time.