A “String Algorithm” for Shortest Path in Directed Networks

Victor Klee
Additional contact information
Victor Klee: University of Washington and Boeing Scientific Research Labs., Seattle, Washington

Operations Research, 1964, vol. 12, issue 3, 428-432

Abstract: Any shortest-path algorithm A for undirected networks can be combined with the simple cutting procedure C described below so as to form a shortest-path algorithm for directed networks. If a directed network has v nodes and e arcs, then a shortest path joining two specified nodes can be found by min[ v , 1/2( e + 2)] or fewer applications of A, each followed by an application; of C.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.3.428 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:12:y:1964:i:3:p:428-432

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().