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
0.6959103941917419
0 references
0.6710818409919739
0 references
0.6564844250679016
0 references
0.6551401615142822
0 references
