Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds (Q5283371)
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: Multi-agent pathfinding with n agents on graphs with n vertices: combinatorial classification and tight algorithmic bounds |
scientific article; zbMATH DE number 6751066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds |
scientific article; zbMATH DE number 6751066 |
Statements
Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds (English)
0 references
21 July 2017
0 references
0.791282057762146
0 references
0.7665988802909851
0 references
0.7645090222358704
0 references
0.7598535418510437
0 references
