A bidirectional shortest-path algorithm with good average-case behavior (preliminary version)
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 394-403
- https://doi.org/10.1007/bfb0015765
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Branch and Bound Methods for the Traveling Salesman ProblemPublished by Defense Technical Information Center (DTIC) ,1983
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Analytic InequalitiesPublished by Springer Nature ,1970
- A note on two problems in connexion with graphsNumerische Mathematik, 1959