The impact of a bi-connected graph decomposition on solving cooperative path-finding problems

DOI10.3233/FI-2014-1123MaRDI QIDQ5259294zbMATHOpenAlexFDO

Authors Pavel Surynek, Petra Surynková, 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)

Recommendations

• Why should biconnected components be identified first
• Minimal path decomposition of complete bipartite graphs
• scientific article; zbMATH DE number 4155927
• On the parallel computation of the biconnected and strongly connected co-components of graphs
• A heuristic approach for dividing graphs into bi-connected components with a size constraint

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)