A parallel shortest path algorithm
From MaRDI portal
Publication:1112621
DOI10.1007/BF02276912zbMath0659.68089MaRDI QIDQ1112621
Publication date: 1988
Published in: Computing (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
A parallel tabu search algorithm for large traveling salesman problems, Parallel asynchronous label-correcting methods for shortest paths, MM: a bidirectional search algorithm that is guaranteed to meet in the middle, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- An improvement of Dijkstra's method for finding a shortest path in a graph
- Shortest-path algorithms: Taxonomy and annotation
- Shortest path methods: A unifying approach
- Finding the Shortest Route between Two Points in a Network
- An Appraisal of Some Shortest-Path Algorithms