A bidirectional shortest-path algorithm with good average-case behavior
Authors:
- 1 June 1989
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1-4) , 551-567
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Branch and Bound Methods for the Traveling Salesman Problem1983
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Analytic Inequalities1970