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

DOI10.3233/FI-2014-1123zbMATH Open1316.05101OpenAlexW1683819337MaRDI QIDQ5259294FDOQ5259294

Petra Surynková, Pavel Surynek, Miloš Chromý

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1123

zbMATH Keywords

BIBOX algorithmcooperative path-finding problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259294)