The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems (Q5259294)
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: The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems |
scientific article; zbMATH DE number 6451166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems |
scientific article; zbMATH DE number 6451166 |
Statements
The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems (English)
0 references
26 June 2015
0 references
BIBOX algorithm
0 references
cooperative path-finding problems
0 references
