Pages that link to "Item:Q1400003"

The following pages link to A fast algorithm to generate necklaces with fixed content (Q1400003):

Displaying 23 items.

• 3-dimensional necklace flower constellations (Q680982) (← links)
• New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
• A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
• The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
• An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
• Generating bracelets with fixed content (Q1939284) (← links)
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences (Q2061815) (← links)
• Compression of periodic complementary sequences and applications (Q2256101) (← links)
• Description of degenerate two-dimensional singularities with single critical point (Q2287139) (← links)
• Charm bracelets and their application to the construction of periodic Golay pairs (Q2345628) (← links)
• Efficient iteration in admissible combinatorial classes (Q2581353) (← links)
• On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two (Q2678917) (← links)
• Generating bracelets in constant amortized time (Q2784451) (← links)
• Generating fixed density bracelets of arbitrary base (Q2875290) (← links)
• Algorithms for Necklace Maps (Q2950591) (← links)
• Non-crossing Tree Realizations of Ordered Degree Sequences (Q2964006) (← links)
• COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS (Q3551021) (← links)
• Generating necklaces (Q4020354) (← links)
• (Q4252356) (← links)
• An Efficient Algorithm for Generating Necklaces with Fixed Density (Q4943839) (← links)
• A random necklace model (Q5461775) (← links)
• Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
• Super domination: graph classes, products and enumeration (Q6130203) (← links)