An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220): Difference between revisions
From MaRDI portal
Latest revision as of 10:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient parallel algorithm for shortest paths in planar layered digraphs |
scientific article |
Statements
An efficient parallel algorithm for shortest paths in planar layered digraphs (English)
0 references
18 March 1996
0 references
shortest paths
0 references
directed graph
0 references
planar layered digraphs
0 references