An efficient algorithm for generating necklaces with fixed density

Authors:
Joe Sawada;Frank Ruskey
Affiliations:
Department of Computer Science, University of Victoria, Victoria, B.C., Canada;Department of Computer Science, University of Victoria, Victoria, B.C., Canada
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 5
Cited 2

An algorithm for generating necklaces of beads in two colors

Discrete Mathematics
Generation of a section of conjugation classes and Lyndon word tree of limited length

Theoretical Computer Science
Generating necklaces

Journal of Algorithms
Average cost of Duval's algorithm for generating Lyndon words

Theoretical Computer Science
A Gray Code for Necklaces of Fixed Density

SIAM Journal on Discrete Mathematics

A fast algorithm to generate unlabeled necklaces

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract