How to sort by walking on a tree

DOI10.1007/978-3-662-48350-3_54MaRDI QIDQ3452827zbMATH OpenOpenAlexFDO

Authors Daniel Graf

Publication date 19 November 2015

Published in Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48350-3_54

zbMATH Keywords

permutation propertiesphysical sortingrobot schedulingshortest sorting walkwarehouse reorganization

Mathematics Subject Classification ID

Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Nonnumerical algorithms (68W05)

Recommendations

• How to sort by walking and swapping on paths and trees
• Sorting networks on restricted topologies
• A sorting network on trees
• Routing on trees
• Sorting with networks of data structures

Cites work

• A simple derivation of edmonds' algorithm for optimum branchings
• Finding optimum branchings
• Hamilton Paths in Grid Graphs
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Optimum branchings
• Robust algorithms for sorting railway cars
• Storage yard operations in container terminals: literature overview, trends, and research directions

Cited in

(3)

• Sorting on graphs by adjacent swaps using permutation groups
• How to sort by walking and swapping on paths and trees
• Complexity of token swapping and its variants

This page was built for publication: How to sort by walking on a tree

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