Upper bounds for sorting permutations with a transposition tree (Q4928334)
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: Upper bounds for sorting permutations with a transposition tree |
scientific article; zbMATH DE number 6173865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for sorting permutations with a transposition tree |
scientific article; zbMATH DE number 6173865 |
Statements
UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (English)
0 references
11 June 2013
0 references
Cayley graphs
0 references
diameter
0 references
graph algorithms
0 references
greedy algorithms
0 references
permutations
0 references
sorting
0 references
strings
0 references
transposition trees
0 references
upper bound
0 references
0 references
0.8336319923400879
0 references
0.8072006106376648
0 references
0.8025358319282532
0 references
0.7952381372451782
0 references
