A parallel shortest path algorithm (Q1112621): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An improvement of Dijkstra's method for finding a shortest path in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest path methods: A unifying approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the Shortest Route between Two Points in a Network / rank | |||
Normal rank | |||
Latest revision as of 10:12, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel shortest path algorithm |
scientific article |
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
