The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems
From MaRDI portal
Publication:5259294
DOI10.3233/FI-2014-1123zbMath1316.05101OpenAlexW1683819337MaRDI QIDQ5259294
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems