Sorting with networks of data structures

We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted to networks that are directed acyclic graphs (DAGs) of stacks and/or queues. In this paper we study the question of which are the smallest general graphs that can sort an arbitrary permutation and what is their efficiency. We show that certain two node graphs can sort in time Θ(

• Type: Journal
• Year: 2010
• Where: DAM
• Authors: Therese C. Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro
• Keywords: DAM 2008, DAM 2010, Data Structures, Node Graphs, Permutations