2010-12-01
Note on "A new bidirectional algorithm for shortest paths"
Publication
Publication
European Journal of Operational Research , Volume 207 - Issue 2 p. 1140- 1141
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.
| Additional Metadata | |
|---|---|
| , , | |
| doi.org/10.1016/j.ejor.2010.06.003, hdl.handle.net/1765/20069 | |
| European Journal of Operational Research | |
| Organisation | Erasmus MC: University Medical Center Rotterdam |
|
Pijls, W., & Post, H. (2010). Note on "A new bidirectional algorithm for shortest paths". European Journal of Operational Research, 207(2), 1140–1141. doi:10.1016/j.ejor.2010.06.003 |
|