Sorting by prefix block-interchanges
From MaRDI portal
Publication:6038693
DOI10.1016/j.tcs.2023.113857arXiv2008.13640OpenAlexW3081674494MaRDI QIDQ6038693
Publication date: 2 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.13640
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Pancake flipping is hard
- Polynomial-time sortable stacks of burnt pancakes
- Sorting permutations by block-interchanges
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
- The complexity of finding minimum-length generator sequences
- On the parameterized complexity of short computation and factorization
- Approximation algorithms for sorting permutations by extreme block-interchanges
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- On sorting unsigned permutations by double-cut-and-joins
- Lower Bounding Edit Distances between Permutations
- Sorting by Transpositions Is Difficult
- Transforming cabbage into turnip
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Sorting by Transpositions
This page was built for publication: Sorting by prefix block-interchanges
