Short proofs for cut-and-paste sorting of permutations
From MaRDI portal
Publication:2461214
DOI10.1016/j.disc.2007.01.011zbMath1128.05001arXivmath/0605084MaRDI QIDQ2461214
Ivan Hal Sudborough, Douglas B. West, Daniel W. Cranston
Publication date: 27 November 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0605084
05A05: Permutations, words, matrices
Related Items
CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS, On the effective and automatic enumeration of polynomial permutation classes, A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations, Bounding prefix transposition distance for strings and permutations, Sorting by shuffling methods and a queue, A NOTE ON COMPLEXITY OF GENETIC MUTATIONS, A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
Cites Work