An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:49, 1 February 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
