The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm

DOI10.1007/BF01299142zbMath0776.90083MaRDI QIDQ1260623

Richard V. Helgason, Jeffrey L. Kennington, B. Douglas Stewart

Publication date: 30 August 1993

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

heuristics; parallel algorithm; shortest-path algorithms

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65Y05: Parallel numerical computation

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Parallel asynchronous label-correcting methods for shortest paths

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Improvements for the thresh X2 shortest path algorithm
• A note on the partitioning shortest path algorithm
• A parallel shortest path algorithm
• On the Shortest Route Through a Network
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Shortest-path algorithms: Taxonomy and annotation
• Shortest path methods: A unifying approach
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• Finding the Shortest Route between Two Points in a Network
• An Appraisal of Some Shortest-Path Algorithms