A parallel shortest path algorithm
From MaRDI portal
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.
Recommendations
Cites work
- A note on two problems in connexion with graphs
- An Appraisal of Some Shortest-Path Algorithms
- An improvement of Dijkstra's method for finding a shortest path in a graph
- Finding the Shortest Route between Two Points in a Network
- Shortest path methods: A unifying approach
- Shortest-path algorithms: Taxonomy and annotation
Cited in
(28)- Parallel algorithms for shortest path problems in polygons
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Parallel algorithms for solving aggregated shortest-path problems
- A computational improvement for a shortest paths ranking algorithm
- A parallel tabu search algorithm for large traveling salesman problems
- A two-phase shortest path algorithm for networks with node coordinates
- The shortest path in parallel
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- Parallel asynchronous label-correcting methods for shortest paths
- Efficient parallel processing methods for road map queries
- Parallel performance research of shortest path problem based on PC cluster
- Accelerated parallel projection method for solving the shortest distance problem
- scientific article; zbMATH DE number 6708314 (Why is no real title available?)
- scientific article; zbMATH DE number 4016203 (Why is no real title available?)
- A Newton-like algorithm for the shortest path based on the method of evolving junctions
- A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space
- A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation
- scientific article; zbMATH DE number 4066938 (Why is no real title available?)
- scientific article; zbMATH DE number 56471 (Why is no real title available?)
- scientific article; zbMATH DE number 1475207 (Why is no real title available?)
- Δ-stepping: a parallelizable shortest path algorithm
- Design and research of parallel schemes for the Dantzig algorithm
- Shared-memory parallel frontier-based search
- scientific article; zbMATH DE number 7266346 (Why is no real title available?)
- scientific article; zbMATH DE number 6452892 (Why is no real title available?)
- scientific article; zbMATH DE number 2208627 (Why is no real title available?)
- Computational Science – ICCS 2005
- An algorithm to find all paths between two nodes in a graph
This page was built for publication: A parallel shortest path algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112621)
