Abstract
We consider a sorting problem on networks whose nodes are storage elements of type stack or queue. A railway switchyard could be an instance of such a network. Given is an input node where a permutation of items 1 to n is delivered and an output node where they are expected in sorted order. How many moves, where an item is transfered from one node to an adjacent node, are needed in the worst case for the sorting? Among others we have the following results: A characterization of networks where the sorting complexity is Θ(nlogn). A lower bound of Ω(n 2 − ε) for the network consisting of only two stacks that can exchange items.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amato, N., Blum, M., Irani, S., Rubinfeld, R.: Reversing trains: a turn of the century sorting problem. J. Alg. 10, 413–428 (1989)
Atkinson, M.D., Livesy, M.J., Tulley, D.: Permutations generated by token passing in graphs. Theor. Comput. Sci. 178, 103–118 (1997)
Bóna, M.: A survey of stack-sorting disciplines. Electr. J. Combin. 9(2), 16 pages (2003)
Bóna, M.: Combinatorics of Permutations. Chapman & Hall, Boca Raton (2004)
Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 1. Addison-Wesley, Reading (updated and revised) (1997)
König, F.G., Lübbecke, M.E.: Sorting with Complete Networks of Stacks, TU Berlin, Mathematik (preprint, 036-2007)
König, F.G., Lübbecke, M.E., Möhring, R.H., Schäfer, G., Spenke, I.: Solutions to real-world instances of Pspace-complete stacking. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 729–740. Springer, Heidelberg (2007)
Tarjan, R.: Sorting using networks of queues and stacks. J. Assoc. Comput. Mach. 19, 341–346 (1972)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felsner, S., Pergel, M. (2008). The Complexity of Sorting with Networks of Stacks and Queues. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)