Generating fixed density bracelets of arbitrary base

Bracelets are lexicographically minimal k-ary strings symmetric under rotation and reversal. In this paper, we present an algorithm for lexicographic listing of bracelets with fixed density. Our algorithm works for arbitrarily large alphabet size and each successive bracelet is generated in constant...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 91; no. 3; pp. 434 - 446
Main Authors Karim, S., Alamgir, Z., Husnine, S. M.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 04.03.2014
Taylor & Francis Ltd
Subjects
05-04
Algorithms
Alphabets
bracelet with fixed density
Bracelets
CAT algorithm
combinatorial generation
Density
Jewelry
Mathematical models
necklace
Strings
Online AccessGet full text

Cover

More Information
Summary:Bracelets are lexicographically minimal k-ary strings symmetric under rotation and reversal. In this paper, we present an algorithm for lexicographic listing of bracelets with fixed density. Our algorithm works for arbitrarily large alphabet size and each successive bracelet is generated in constant amortized time.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160.2013.805753