An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:09, 5 March 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
