Note on "A new bidirectional algorithm for shortest paths"

Wim Pijls, H Post

Research output: Contribution to journalArticleAcademicpeer-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 languageEnglish
Pages (from-to)1140-1141
Number of pages2
JournalEuropean Journal of Operational Research
Volume207
Issue number2
DOIs
Publication statusPublished - 2010

Research programs

  • EUR ESE 32

Fingerprint

Dive into the research topics of 'Note on "A new bidirectional algorithm for shortest paths"'. Together they form a unique fingerprint.

Cite this