The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems

Abstrakt

The impact of ear decomposition of a bi-connected graph on the performance of the BIBOX algorithm is studied. An extensive experimental evaluation of the BIBOX algorithm with various ear decompositions is conducted.

Klíčová slova

• Bi-connected Graph
• Cooperative
• Path-finding
• Problems