Tighter upper bound for sorting permutations with prefix transpositions (Q497672): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:12, 30 January 2024
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
