A parallel shortest path algorithm

DOI10.1007/BF02276912MaRDI QIDQ1112621zbMATH OpenFDO

Authors Th. Mohr, C. Pasche

Publication date 1988

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

networkparallel algorithmshortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 56471
• scientific article; zbMATH DE number 278831
• Parallel algorithms for solving aggregated shortest-path problems
• An Auction Algorithm for Shortest Paths
• Parallel Algorithms for Dynamic Shortest Path Problems

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

(26)

• Parallel asynchronous label-correcting methods for shortest paths
• An algorithm to find all paths between two nodes in a graph
• Design and research of parallel schemes for the Dantzig algorithm
• scientific article; zbMATH DE number 2208627 (Why is no real title available?)
• A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
• scientific article; zbMATH DE number 56471 (Why is no real title available?)
• Accelerated parallel projection method for solving the shortest distance problem
• scientific article; zbMATH DE number 1475207 (Why is no real title available?)
• Computational Science – ICCS 2005
• A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation
• scientific article; zbMATH DE number 4016203 (Why is no real title available?)
• Efficient parallel processing methods for road map queries
• scientific article; zbMATH DE number 6708314 (Why is no real title available?)
• scientific article; zbMATH DE number 7266346 (Why is no real title available?)
• A parallel tabu search algorithm for large traveling salesman problems
• Shared-memory parallel frontier-based search
• A Newton-like algorithm for the shortest path based on the method of evolving junctions
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• Δ-stepping: a parallelizable shortest path algorithm
• Parallel algorithms for shortest path problems in polygons
• scientific article; zbMATH DE number 4066938 (Why is no real title available?)
• The shortest path in parallel
• Parallel performance research of shortest path problem based on PC cluster
• scientific article; zbMATH DE number 6452892 (Why is no real title available?)
• A computational improvement for a shortest paths ranking algorithm

Describes a project that uses

Uses Software

• Algorithm 360

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)