A new upper bound for sorting permutations with prefix transpositions
From MaRDI portal
Publication:5859487
DOI10.1142/S1793830920500779zbMath1505.68008MaRDI QIDQ5859487
Bhadrachalam Chitturi, Rajan Sundaravaradhan, Pramod P. Nair
Publication date: 16 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (3)
Generation of the symmetric group Sn2 ⋮ Improved upper bound for sorting permutations by prefix transpositions ⋮ Approximation algorithms for sorting permutations by extreme block-interchanges
Cites Work
- Tighter upper bound for sorting permutations with prefix transpositions
- Bounding prefix transposition distance for strings and permutations
- Sorting by bounded block-moves
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Sorting by Transpositions Is Difficult
- A group-theoretic model for symmetric interconnection networks
- Sorting by Transpositions
This page was built for publication: A new upper bound for sorting permutations with prefix transpositions
