(Enter summary)
Abstract: Terry MinYih Wang
Carla D. Savage
Department of Computer Science
North Carolina State University
Raleigh, North Carolina 27695
July 12, 1990
Abstract
In this paper we present an algorithm for generating the lexicographically
smallest representatives of all the n-bead necklaces in k-colors. The
time required is O(nN
n
k ), where N
n
k is the number of necklaces with n beads
of k colors. To our knowledge, this is the first algorithm for this problem
which has been proved to... (Update)
Similar documents based on text: More All
0.7: Formal Group-Theoretic Generalizations of the Necklace Algebra.. - Lenart
(Correct)
0.7: An Efficient Algorithm for Generating Necklaces with Fixed.. - Ruskey, Sawada (1999)
(Correct)
0.6: Generating Necklaces - Ruskey, Savage, Wang (1992)
(Correct)
BibTeX entry: (Update)
@article{ wang90new,
author = "Wang",
title = "New Results on the Costs of Huffman Trees",
journal = "AJC: Australasian Journal of Combinatorics",
volume = "1",
year = "1990",
url = "citeseer.ist.psu.edu/wang90new.html" }
Citations (may not include all citations):
39
Gray codes and paths on the n-cube (context) - Gilbert - 1958
23
Generation of permutations by adjacent transpositions (context) - Johnson
15
An algorithm for generating necklaces of beads in two colors (context) - Fredericksen, Kessler - 1986
Documents on the same site (http://www.csc.ncsu.edu/faculty/savage/papers.html): More
A Gray Code for Combinations of a Multiset - Ruskey, Savage (1995)
(Correct)
Monotone Gray Codes and the Middle Levels Problem - Savage, Winkler (1995)
(Correct)
Basis Partitions - Nolan, Savage, Wilf
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC