Sorting with Complete Networks of Stacks

DOI10.1007/978-3-540-92182-0_78MaRDI QIDQ3597888zbMATH OpenOpenAlexFDO

Authors Felix G. König, Marco E. Lübbecke

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://depositonce.tu-berlin.de/handle/11303/15612

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• The Complexity of Sorting with Networks of Stacks and Queues
• Sorting with networks of data structures
• Sorting networks: to the end and back again
• Constructing sorting networks from k-sorters
• Sorting networks on restricted topologies
• Optimal-depth sorting networks
• Optimal sorting networks
• A sorting network in bounded arithmetic
• A sorting network on trees

Cited in

(11)

• A survey of stack-sorting disciplines
• Generalised online colouring problems in overlap graphs
• Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
• Rerouting shortest paths in planar graphs
• On rearrangement of items stored in stacks
• A mathematical formulation and complexity considerations for the blocks relocation problem
• Efficient algorithms for sorting k-sets in bins
• Constructing sorting networks from k-sorters
• Sorting with networks of data structures
• On sorting with a network of two stacks
• New formulation for coloring circle graphs

This page was built for publication: Sorting with Complete Networks of Stacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597888)