How to sort by walking and swapping on paths and trees (Q2408166): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: INSERTION SORT is \(O(n \log n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of stack-sorting disciplines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancake flipping is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithm for Sliding Tokens on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electronic Data Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Placement and Shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Complexity of a Simple Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for sorting by prefix reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shunting for Dummies: An Introductory Algorithmic Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Sort by Walking on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a vehicle of capacity greater than one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class Steiner trees and VLSI-design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding minimum-length generator sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple derivation of edmonds' algorithm for optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Using Networks of Queues and Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping labeled tokens on graphs / rank
 
Normal rank

Revision as of 12:13, 14 July 2024

scientific article
Language Label Description Also known as
English
How to sort by walking and swapping on paths and trees
scientific article

    Statements

    How to sort by walking and swapping on paths and trees (English)
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    physical sorting
    0 references
    shortest sorting walk
    0 references
    warehouse reorganization
    0 references
    robot scheduling
    0 references
    robot transportation problem
    0 references
    permutation properties
    0 references
    ensemble motion planning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references