Routing by matching on convex pieces of grid graphs

DOI10.1016/j.comgeo.2022.101862OpenAlexW4210878846MaRDI QIDQ2123294

Yanyan Li

Publication date: 8 April 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.10751

zbMATH Keywords

makespanmotion planningparallel sortingrouting numbertoken graph

Mathematics Subject Classification ID

Graph theory (05Cxx) Real and complex geometry (51Mxx) Fiber spaces and bundles in algebraic topology (55Rxx)

Cites Work

• Unnamed Item
• Invitation to topological robotics
• Discrete configuration spaces of squares and hexagons
• Min-Type Morse Theory for Configuration Spaces of Hard Spheres
• The Markov chain Monte Carlo revolution
• Routing Permutations on Graphs via Matchings

This page was built for publication: Routing by matching on convex pieces of grid graphs