Routing by matching on convex pieces of grid graphs

DOI10.1016/J.COMGEO.2022.101862MaRDI QIDQ2123294zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 8 April 2022

Published in Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• Routing numbers of cycles, complete bipartite graphs, and hypercubes
• Routing in polygons without rectilinearly visible corners
• Routing number of digraphs and product graphs
• Routing number of dense and expanding graphs
• Routing on trees via matchings

Cites work

• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
• Discrete configuration spaces of squares and hexagons
• Invitation to topological robotics
• Min-type Morse theory for configuration spaces of hard spheres
• Routing Permutations on Graphs via Matchings
• The Markov chain Monte Carlo revolution

Cited in

(3)

• Routing sets in the integer lattice
• Routing by matching on convex pieces of grid graphs
• On a conjecture related to geometric routing

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

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