𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Efficient Algorithm for Generating Necklaces with Fixed Density

✍ Scribed by Ruskey, Frank; Sawada, Joe

Book ID
118177564
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
316 KB
Volume
29
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for generating necklaces of
An algorithm for generating necklaces of beads in two colors
✍ Harold Fredricksen; Irving J. Kessler πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 491 KB

In this paper we describe the necklaces of beads of length n in two colors and their equivalence to binary cycles ,from a circulating register of length n. We exhibit a correspondence between the binary cycles of length n and the lexicographic compositions of the integer n. We then give algorithms t

A fast algorithm to generate necklaces w
A fast algorithm to generate necklaces with fixed content
✍ Joe Sawada πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 230 KB

We develop a fast algorithm for listing all necklaces with ΓΏxed content. By ΓΏxed content, we mean the number of occurrences of each alphabet symbol is ΓΏxed. Initially, we construct a simple but ine cient algorithm by making some basic modiΓΏcations to a recursive necklace generation algorithm. We the