The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
From MaRDI portal
Publication:1260623
DOI10.1007/BF01299142zbMath0776.90083OpenAlexW2049802874MaRDI QIDQ1260623
Richard V. Helgason, B. Douglas Stewart, Jeffrey L. Kennington
Publication date: 30 August 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01299142
Programming involving graphs or networks (90C35) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (5)
Using link analysis technique with a modified shortest-path algorithm to fight money laundering ⋮ Parallel asynchronous label-correcting methods for shortest paths ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems ⋮ Resource extension functions: properties, inversion, and generalization to segments
Uses Software
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
This page was built for publication: The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
