An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027)

From MaRDI portal
Revision as of 19:21, 28 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5059347
Language Label Description Also known as
English
An efficient parallel algorithm for shortest paths in planar layered digraphs
scientific article; zbMATH DE number 5059347

    Statements

    An efficient parallel algorithm for shortest paths in planar layered digraphs (English)
    0 references
    4 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references