Parallel algorithms for shortest paths and related problems on trapezoid graphs (Q4511224)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1522928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for shortest paths and related problems on trapezoid graphs |
scientific article; zbMATH DE number 1522928 |
Statements
13 February 2001
0 references
shortest paths
0 references
trapezoid graph
0 references
parallel algorithms
0 references
0.8255038261413574
0 references
0.8154730796813965
0 references
0.8031842708587646
0 references
Parallel algorithms for shortest paths and related problems on trapezoid graphs (English)
0 references
The authors consider parallel algorithms for shortest paths and related problems on trapezoid graphs under the CREW PRAM model. Their algorithms are easy to implement as they use only simple techniques such as parallel prefix and suffix computations. For the entire collection see [Zbl 0933.00045].
0 references