Pages that link to "Item:Q3541123"
From MaRDI portal
The following pages link to Edit Distances and Factorisations of Even Permutations (Q3541123):
Displaying 9 items.
- Hamiltonian cycles in unitary prefix transposition rearrangement graphs (Q491601) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- The distribution of cycles in breakpoint graphs of signed permutations (Q2446324) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- (Q6065464) (← links)