Shortened universal cycles for permutations (Q2097185): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4307698268 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2204.02910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal cycles of labeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph universal cycles of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Algorithm to Construct Universal Cycles for Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal partial words over non-binary alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorthand universal cycles for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: s-Overlap Cycles for Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Cycles for Weak Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles of \(k\)-subsets and \(k\)-permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shortening \(u\)-cycles and \(u\)-words for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal cycles for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new universal cycle for permutations / rank
 
Normal rank

Latest revision as of 20:05, 30 July 2024

scientific article
Language Label Description Also known as
English
Shortened universal cycles for permutations
scientific article

    Statements

    Shortened universal cycles for permutations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2022
    0 references
    0 references
    universal cycles
    0 references
    permutation
    0 references
    compression
    0 references
    0 references
    0 references