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

From MaRDI portal
Revision as of 07:20, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q51999546, #quickstatements; #temporary_batch_1712286835472)
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
    0 references
    0 references