Routing by matching on convex pieces of grid graphs

DOI10.1016/J.COMGEO.2022.101862OpenAlexW4210878846MaRDI QIDQ2123294FDOQ2123294

Authors: 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

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

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

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

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)