Tighter upper bound for sorting permutations with prefix transpositions (Q497672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6485287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter upper bound for sorting permutations with prefix transpositions |
scientific article; zbMATH DE number 6485287 |
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
0.9424821138381958
0 references
0.916106641292572
0 references
0.8518613576889038
0 references
0.8190977573394775
0 references
0.8079778552055359
0 references
