Note on "A new bidirectional algorithm for shortest paths"

Wim Pijls; H Post

doi:10.1016/j.ejor.2010.06.003

Note on "A new bidirectional algorithm for shortest paths"

Wim Pijls
, H Post

Econometrics

Research output: Contribution to journal › Article › Academic › peer-review

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1140-1141
Number of pages	2
Journal	European Journal of Operational Research
Volume	207
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2010.06.003
Publication status	Published - 2010

Research programs

EUR ESE 32

Access to Document

10.1016/j.ejor.2010.06.003

http://hdl.handle.net/1765/20069

Cite this

@article{fbd9869a61184e9fa25a078e3a32bb81,

title = "Note on {"}A new bidirectional algorithm for shortest paths{"}",

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.",

author = "Wim Pijls and H Post",

year = "2010",

doi = "10.1016/j.ejor.2010.06.003",

language = "English",

volume = "207",

pages = "1140--1141",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Note on "A new bidirectional algorithm for shortest paths"

AU - Pijls, Wim

AU - Post, H

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

U2 - 10.1016/j.ejor.2010.06.003

DO - 10.1016/j.ejor.2010.06.003

M3 - Article

SN - 0377-2217

VL - 207

SP - 1140

EP - 1141

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

Note on "A new bidirectional algorithm for shortest paths"

Abstract

Research programs

Access to Document

Fingerprint

Cite this