A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
