This article is cited in 1 paper

Developing Systems

Finding a shortest path in a graph using the minorant of the Bellman function

E. N. Orël

Moscow

Abstract: An algorithm is proposed for finding a shortest path in a graph using an arbitrary function which bounds the Bellman function from below. The algorithm sees only those vertices which are suspected functions of the desired path.

UDC: 519.283


Received: 19.01.1976

 English version: Automation and Remote Control, 1977, 38:2, 235–237

Bibliographic databases:

• 
•