A generalized permanent label setting algorithm for the shortest path between specified nodes. (English) Zbl 0234.90063


90C35 Programming involving graphs or networks
Full Text: DOI


[1] Dreyfus, S.E, An appraisal of some shortest-path algorithms, Operations res., 17, 395-412, (1969) · Zbl 0172.44202
[2] Dijkstra, E.W, A note on two problems in connexion with graphs, Numer. math., 1, 269-271, (1959) · Zbl 0092.16002
[3] Dantzig, G.B, On the shortest route through a network, Management sci., 6, 187-190, (1960) · Zbl 0995.90518
[4] Doulliez, P, Optimal capacity planning of multiterminal networks, ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.