Tighter upper bound for sorting permutations with prefix transpositions (Q497672)

From MaRDI portal
Revision as of 23:28, 30 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Tighter upper bound for sorting permutations with prefix transpositions
scientific article

    Statements

    Tighter upper bound for sorting permutations with prefix transpositions (English)
    0 references
    25 September 2015
    0 references
    Cayley graphs
    0 references
    permutations
    0 references
    sorting
    0 references
    prefix transpositions
    0 references
    diameter
    0 references
    upper bound
    0 references

    Identifiers