Efficient algorithm for generating necklaces with fixed density

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 671-684

  Ruskey, Frank ^a   Sawada, Joe ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES;

APERIODIC NECKLACES; LYNDON WORDS;

COMBINATORIAL MATHEMATICS;

EID: 0033299654     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798344112     Document Type: Article

References (9)

1. J. BERSTEL AND M. POCCHIOLA, Average cost of Duval's algorithm for generating Lyndon words, Theoret. Comput. Sci., 132 (1994), pp. 415-425.
2. K. CATTELL, F. RUSKEY, J. SAWADA, C. R. MIERS, AND M. SERRA, Fast Algorithms to Generate Unlabeled Necklaces and Irreducible Polynomials over GF(2), manuscript, 1998.
3. J.-P. DUVAL, Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée, Theoret. Comput. Sci., 60 (1988), pp. 255-283.
4. H. FREDRICKSEN AND I. J. KESSLER, An algorithm for generating necklaces of beads in two colors, Discrete Math., 61 (1986), pp. 181-188.
5. H. FREDRICKSEN AND J. MAIORANA, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math., 23 (1978), pp. 207-210.
6. E. N. GILBERT AND J. RIORDAN, Symmetry types of periodic sequences, Illinois J. Math., 5 (1961), pp. 657-665.
7. C. REUTENAUER, Free Lie Algebras, Clarendon Press, Oxford, England, 1993.
8. F. RUSKEY, C. D. SAVAGE, AND T. WANG, Generating necklaces, J. Algorithms, 13 (1992), pp. 414-430.
9. T. M. Y. WANG AND C. D. SAVAGE, A Gray code for necklaces of fixed density, SIAM J. Discrete Math., 9 (1996), pp. 654-673.