An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel algorithm for shortest paths in planar layered digraphs |
scientific article; zbMATH DE number 803318
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for shortest paths in planar layered digraphs |
scientific article; zbMATH DE number 803318 |
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
1.0000002
0 references
0.97572964
0 references
0.9624869
0 references
0.9414399
0 references
0.92493457
0 references
0.9190506
0 references
0.91806394
0 references
