A parallel shortest path algorithm (Q1112621)
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: A parallel shortest path algorithm |
scientific article; zbMATH DE number 4078827
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel shortest path algorithm |
scientific article; zbMATH DE number 4078827 |
Statements
A parallel shortest path algorithm (English)
0 references
1988
0 references
A new algorithm to find the shortest path between a pair of nodes is presented. In one hand this algorithm expands the search from origin and destination simultaneously, on the other hand it uses a lower bound for the shortest paths to guide this search. Computational comparisons with existing algorithms show its efficiency. The implementation on a parallel computer is also discussed.
0 references
parallel algorithm
0 references
network
0 references
shortest path
0 references
