Generating fixed density bracelets of arbitrary base
Saira Karim, Zareen Alamgir, Syed Muhammad Husnine · International Journal of Computer Mathematics · 2013
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.