Generating Necklaces

Abstract

A k color n bead necklace is an equivalence class of k ary n tuples under rotation In this paper we analyze an algorithm due to Fredricksen Kessler and Maiorana FKM to show that necklaces can be generated in constant amortized time We also present a new approach to generating necklaces which we conjecture can also be implemented in constant amortized time… (More)
DOI: 10.1016/0196-6774(92)90047-G

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics