Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q169706 |
||
Property / author | |||
Property / author: Q239694 / rank | |||
Revision as of 06:27, 10 February 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