Generating fixed density bracelets of arbitrary base

DOI10.1080/00207160.2013.805753zbMath1299.68040OpenAlexW2081587679MaRDI QIDQ2875290

Saira Karim, Zareen Alamgir, Syed Muhammad Husnine

Publication date: 14 August 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.805753

zbMATH Keywords

necklaceCAT algorithmcombinatorial generationbracelet with fixed density

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics on words (68R15)

Related Items (1)

Finding the largest fixed-density necklace and Lyndon word

Cites Work

• Unnamed Item
• An efficient algorithm for solving pseudo clique enumeration problem
• More restrictive Gray codes for necklaces and Lyndon words
• A fast algorithm to generate necklaces with fixed content
• Generating bracelets with fixed content
• Generating Bracelets in Constant Amortized Time
• Generating necklaces
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• On the generation of bicliques of a graph

This page was built for publication: Generating fixed density bracelets of arbitrary base