An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:06, 7 March 2024

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