A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation |
scientific article |
Statements
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (English)
0 references
27 July 2016
0 references
combinatorial problems
0 references
permutations
0 references
Cayley graphs
0 references
diameter
0 references
sorting
0 references
0 references
0.7981815338134766
0 references
0.7952381372451782
0 references
0.7878347635269165
0 references
0.772274374961853
0 references
0.7611966729164124
0 references
