A fast algorithm to generate necklaces with fixed content
From MaRDI portal
Publication:1400003
DOI10.1016/S0304-3975(03)00049-5zbMath1022.68130OpenAlexW2148837681MaRDI QIDQ1400003
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00049-5
Related Items (15)
New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Super domination: graph classes, products and enumeration ⋮ Non-crossing Tree Realizations of Ordered Degree Sequences ⋮ COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS ⋮ 3-dimensional necklace flower constellations ⋮ Compression of periodic complementary sequences and applications ⋮ Description of degenerate two-dimensional singularities with single critical point ⋮ On the reconstruction of 3-uniform hypergraphs from step-two degree sequences ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ Efficient iteration in admissible combinatorial classes ⋮ Charm bracelets and their application to the construction of periodic Golay pairs ⋮ Generating fixed density bracelets of arbitrary base
Cites Work
- Symmetry types of periodic sequences
- An algorithm for generating necklaces of beads in two colors
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- ECO:a methodology for the enumeration of combinatorial objects
- A Gray Code for Necklaces of Fixed Density
- A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
- An Efficient Algorithm for Generating Necklaces with Fixed Density
This page was built for publication: A fast algorithm to generate necklaces with fixed content
