Generating fixed density bracelets of arbitrary base
From MaRDI portal
Recommendations
- Generating bracelets with fixed content
- Generating bracelets in constant amortized time
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- scientific article; zbMATH DE number 1305469
- Charm bracelets and their application to the construction of periodic Golay pairs
- Generating random braids
- Brace generation
- Cyclic sieving, necklaces, and bracelets
- A Gray Code for Necklaces of Fixed Density
- Generating near‐bipartite bricks
Cites work
- A fast algorithm to generate necklaces with fixed content
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- An efficient algorithm for solving pseudo clique enumeration problem
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Generating bracelets in constant amortized time
- Generating bracelets with fixed content
- Generating necklaces
- More restrictive Gray codes for necklaces and Lyndon words
- On the generation of bicliques of a graph
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
Cited in
(5)- scientific article; zbMATH DE number 3315312 (Why is no real title available?)
- Generating bracelets with fixed content
- Generating bracelets in constant amortized time
- Charm bracelets and their application to the construction of periodic Golay pairs
- Finding the largest fixed-density necklace and Lyndon word
This page was built for publication: Generating fixed density bracelets of arbitrary base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875290)
