Geodesic
Sorting with a forklift
The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a single forkstack, or dually, which permutations of a fixed input stream can be produced using a single forkstack. An algorithm is given to solve the sorting problem and the minimal unsortable sequences are found. The results are extended to fork stacks where there are bounds on how many items can be pushed and popped at one time. In this context we also establish how to enumerate the collection of sortable sequences.
DOI : 10.37236/1681
Classification : 05A15, 68R05
Mots-clés : permutation, sortable sequences 
M. H. Albert; M. D. Atkinson. Sorting with a forklift. The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2. doi: 10.37236/1681
@article{10_37236_1681,
     author = {M. H. Albert and M. D. Atkinson},
     title = {Sorting with a forklift},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     number = {2},
     doi = {10.37236/1681},
     zbl = {1011.05005},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1681/}
}
TY  - JOUR
AU  - M. H. Albert
AU  - M. D. Atkinson
TI  - Sorting with a forklift
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1681/
DO  - 10.37236/1681
ID  - 10_37236_1681
ER  - 
%0 Journal Article
%A M. H. Albert
%A M. D. Atkinson
%T Sorting with a forklift
%J The electronic journal of combinatorics
%D 2002
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1681/
%R 10.37236/1681
%F 10_37236_1681

Cité par Sources :