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

From MaRDI portal
Revision as of 09:25, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6451166
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    26 June 2015
    0 references
    BIBOX algorithm
    0 references
    cooperative path-finding problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references