Sorting by insertion of leading elements

DOI10.1016/0097-3165(87)90022-7zbMath0633.68060OpenAlexW2043016253MaRDI QIDQ1096394

Martin Aigner, Douglas B. West

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90022-7

zbMATH Keywords

pancake problemsorting by insertion

Mathematics Subject Classification ID

Searching and sorting (68P10) Enumerative combinatorics (05A99)

Related Items (5)

Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement ⋮ Short proofs for cut-and-paste sorting of permutations ⋮ CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS ⋮ Sorting permutations by block-interchanges ⋮ Sorting by bounded block-moves

Cites Work

• Bounds for sorting by prefix reversal

This page was built for publication: Sorting by insertion of leading elements