An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (Q2930325)

From MaRDI portal
Revision as of 09:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set
scientific article

    Statements

    An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (English)
    0 references
    0 references
    0 references
    18 November 2014
    0 references
    universal cycle
    0 references
    loopless algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references