Generating necklaces
Authors:
- Frank RuskeyFRFrank Ruskey
- Carla SavageCSCarla Savage
- Terry Min Yih WangTWTerry Min Yih Wang
- 1 September 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (3) , 414-430
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Gray code sequences of partitionsJournal of Algorithms, 1989
- Hamiltonian cycles in the shuffle-exchange networkIEEE Transactions on Computers, 1989
- Adjacent interchange generation of combinationsJournal of Algorithms, 1988
- The rotation graph of binary trees is HamiltonianJournal of Algorithms, 1987
- An algorithm for generating necklaces of beads in two colorsDiscrete Mathematics, 1986
- Necklaces of beads in k colors and k-ary de Bruijn sequencesDiscrete Mathematics, 1978
- Generation of permutations by adjacent transpositionMathematics of Computation, 1963
- Gray Codes and Paths on the n-CubeBell System Technical Journal, 1958