Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds (Q5283371)
From MaRDI portal
scientific article; zbMATH DE number 6751066
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
