More restrictive Gray codes for necklaces and Lyndon words (Q963341): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimal change list for Lucas strings and some graph theoretic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On binary reflected Gray codes and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray-ordered binary necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Generating Necklaces with Fixed Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray codes for necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gray Code for Necklaces of Fixed Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077264 / rank
 
Normal rank

Latest revision as of 16:31, 2 July 2024

scientific article
Language Label Description Also known as
English
More restrictive Gray codes for necklaces and Lyndon words
scientific article

    Statements

    More restrictive Gray codes for necklaces and Lyndon words (English)
    0 references
    19 April 2010
    0 references
    necklaces
    0 references
    Lyndon words
    0 references
    Gray codes
    0 references
    combinatorial problems
    0 references

    Identifiers