Routing by matching on convex pieces of grid graphs (Q2123294)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Routing by matching on convex pieces of grid graphs |
scientific article; zbMATH DE number 7505569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing by matching on convex pieces of grid graphs |
scientific article; zbMATH DE number 7505569 |
Statements
Routing by matching on convex pieces of grid graphs (English)
0 references
8 April 2022
0 references
routing number
0 references
makespan
0 references
motion planning
0 references
token graph
0 references
parallel sorting
0 references
0 references
0.7886469960212708
0 references
0.7603778839111328
0 references
0.7536344528198242
0 references
0.7465006709098816
0 references
0.7413413524627686
0 references
