Title of article
Note on “A new bidirectional algorithm for shortest paths”
Author/Authors
Wim Pijls، نويسنده , , Henk Post، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
2
From page
1140
To page
1141
Abstract
In a previous paper “A new bidirectional algorithm for shortest paths” we presented a bidirectional algorithm for finding the shortest path in a network. After the publication we designed an equivalent but shorter description for that algorithm. Due to this new description a considerably simpler proof is enabled. In this Note we discuss the new version with the related proof.
Keywords
Shortest path , Bidirectional search , Road network search
Journal title
European Journal of Operational Research
Serial Year
2010
Journal title
European Journal of Operational Research
Record number
1312974
Link To Document