A gray code for necklaces of fixed density

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 4, 1996, Pages 654-673

  Wang, Terry Min Yih ^a   Savage, Carla D ^a  

^a North Carolina State University   (United States)

Author keywords

Combinatorial generation; Gray codes; Hamilton cycles; Necklaces

Indexed keywords

EID: 0038551114     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548019528143X     Document Type: Article

References (30)

1. M. BUCK AND D. WIEDEMANN, Gray codes with restricted density, Discrete Math., 48 (1984), pp. 163-171.
2. C. C. CHANG, H. Y. CHEN, AND C. Y. CHEN, Symbolic Gray code as a data allocation scheme for two-disc systems, Comput. J., 35 (1992), pp. 299-305.
3. C. C. CHANG, R. C. T. LEE, AND M. W. DU, Symbolic Gray code as a perfect multiattribute hashing scheme for partial match queries, IEEE Trans. Software Engineering, 8 (1982), pp. 235-249.
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. M. GARDNER, The curious properties of the Gray code and how it can be used to solve puzzles, Scientific American, 227 (1972), pp. 106-109.
7. F. GRAY, Pulse Code Communication, U. S. Patent 2632058, March 17, 1953.
8. S. M. JOHNSON, Generation of permutations by adjacent transpositions, Math. Comput., 17 (1963), pp. 282-285.
9. R. KAYE, A Gray code for set partitions, Inform. Process. Lett., 5 (1976), pp. 171-173.
10. P. KLINGSBERG, A Gray code for compositions, J. Algorithms, 3 (1982), pp. 41-44.
11. R. M. LOSEE, A Gray code based ordering for documents on shelves, J. Amer. Soc. Inform. Sci., 43 (1992), pp. 312-322.
12. J. M. LUCAS, The rotation graph of binary trees is hamiltonian, J. Algorithms, 8 (1987), pp. 503-535.
13. J. M. LUCAS, D. ROELANTS VAN BARONAIGIEN, AND F. RUSKEY, On rotations and the generation of binary trees, J. Algorithms, 15 (1993), pp. 343-366.
14. A. NIJENHUIS AND H. S. WILF, Combinatorial Algorithms for Computers and Calculators, Academic Press Inc., New York, 1978.
15. G. PRUESSE AND F. RUSKEY, Generating the linear extensions of certain posets by transpositions, SIAM J. Discrete Math., 4 (1991), pp. 413-422.
16. G. PRUESSE AND F. RUSKEY, Generating linear extensions fast, SIAM J. Comput., 23 (1994), pp. 373-386.
17. D. RASMUSSEN, C. SAVAGE, AND D. WEST, Gray codes for families of integer partitions, J. Combin. Theory Ser. A, 70 (1995), pp. 201-229.
18. D. RICHARDS, Data compression and Gray-code sorting, Inform. Process. Lett., 22 (1986), pp. 201-205.
19. F. RUSKEY, Adjacent interchange generation of combinations, J. Algorithms, 9 (1988), pp. 162-180.
20. F. RUSKEY, Generating linear extensions of posets by transpositions, J. Combin. Theory Ser. B, 54 (1992), pp. 77-101.
21. F. RUSKEY AND A. PROSKUROWSKI, Generating binary trees by transpositions, J. Algorithms, 11 (1990), pp. 68-84.
22. F. RUSKEY, C. D. SAVAGE, AND T. M. WANG, Generating necklaces, J. Algorithms, 13 (1992), pp. 414-430.
23. C. D. SAVAGE, Gray code sequences of partitions, J. Algorithms, 10 (1989), pp. 577-595.
24. Y. SHILOACH, Fast canonization of circular strings, J. Algorithms, 2 (1981), pp. 107-121.
25. G. STACHOWIAK, Hamilton paths in graphs of linear extensions for unions of posets, SIAM J. Discrete Math., 5 (1992), pp. 199-206.
26. H. F. TROTTER, PERM (Algorithm 115), Comm. ACM, 5 (1962), pp. 434-435.
27. D. B. WEST, Generating linear extensions by adjacent transpositions, J. Combin. Theory Ser. B, 57 (1993), pp. 58-64.
28. T. M. WANG AND C. D. SAVAGE, A New Algorithm for Generating Necklaces, Technical report TR-90-20, Department of Computer Science, North Carolina State University, Raleigh, NC, 1990.
29. T. M. WANG, Gray Codes for Necklaces of Fixed Density, Ph.D. thesis, Department of Computer Science, North Carolina State University, Raleigh, NC, 1994.
30. H. S. WILF, Combinatorial Algorithms: An Update, SIAM, Philadelphia, 1989.