论文信息 - Properties of Labeling Methods for Determining Shortest Path Trees

Properties of Labeling Methods for Determining Shortest Path Trees

A number of labeling procedures for determining shortest paths in a network employ a sequence list in order to carry out the required steps systematically. This paper studies certain formal properties of such sequence lists. It is shown that the desirable property of branching out from nodes whose labels represent actual in-tree distances is assured for certain ways of managing the sequence list, but not for others. The relationship of this property to the computational complexity of various labeling procedures is also investigated.

Douglas R. Shiert | Christoph Witzgallt | Christoph Witzgallt

[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[2] Gerald L. Thompson,et al. Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems , 1972, JACM.

[3] Darwin Klingman,et al. Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[4] Ivan T. Frisch,et al. Communication, transmission, and transportation networks , 1971 .

[5] Douglas R. Shier,et al. Arc tolerances in shortest path and network flow problems , 1980, Networks.

[6] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[7] U. Pape,et al. Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[8] B. Golden. Shortest-Path Algorithms: A Comparison , 1975 .

[9] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[10] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11] Donald B. Johnson,et al. A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.