Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:47, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel algorithms for shortest paths in planar digraphs |
scientific article |
Statements
Efficient parallel algorithms for shortest paths in planar digraphs (English)
0 references
14 December 1992
0 references
planar digraph
0 references
outerplanar digraph
0 references
compact routing tables
0 references
parallel tree contraction
0 references
CREW PRAM
0 references
shortest path
0 references
hammock-decomposition technique
0 references
