How to sort by walking and swapping on paths and trees
DOI10.1007/S00453-017-0282-8zbMATH Open1372.68075OpenAlexW2583609020MaRDI QIDQ2408166FDOQ2408166
Publication date: 10 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0282-8
Recommendations
- How to sort by walking on a tree
- On recursive path ordering
- A sorting network on trees
- Sorting and routing on OTIS-mesh of trees
- Tree traversals and permutations
- scientific article; zbMATH DE number 3921960
- Inorder traversal of splay trees
- scientific article; zbMATH DE number 2121203
- Ordered trees and the inorder traversal
- Permutree sorting
robot schedulingpermutation propertiesensemble motion planningphysical sortingrobot transportation problemshortest sorting walkwarehouse reorganization
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Artificial intelligence for robotics (68T40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding optimum branchings
- Hamilton Paths in Grid Graphs
- Optimum branchings
- Class Steiner trees and VLSI-design
- Bounds for sorting by prefix reversal
- Shunting for Dummies: An Introductory Algorithmic Survey
- Pancake flipping is hard
- Sorting Using Networks of Queues and Stacks
- A survey of stack-sorting disciplines
- Polynomial-Time Algorithm for Sliding Tokens on Trees
- Sorting by Placement and Shift
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- Preemptive Ensemble Motion Planning on a Tree
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Title not available (Why is that?)
- A simple derivation of edmonds' algorithm for optimum branchings
- Nonpreemptive Ensemble Motion Planning on a Tree
- The complexity of finding minimum-length generator sequences
- Swapping labeled tokens on graphs
- How to Sort by Walking on a Tree
- Title not available (Why is that?)
- Routing a vehicle of capacity greater than one
- Electronic Data Sorting
- INSERTION SORT is \(O(n \log n)\)
- A Note on the Complexity of a Simple Transportation Problem
Cited In (1)
This page was built for publication: How to sort by walking and swapping on paths and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408166)
