On shortest paths and sorting

Authors:
Ellis L. Johnson
Affiliations:
IBM
Venue:
ACM '72 Proceedings of the ACM annual conference - Volume 1
Year:
1972

Citing 1
Cited 3

Algorithm 245: Treesort

Communications of the ACM

Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
A unified algorithm for designing multidrop teleprocessing networks

DATACOMM '73 Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design
A Multiple Pairs Shortest Path Algorithm

Transportation Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In finding shortest paths, the operation of finding, successively, a minimum from a list of numbers may require more work than the remainder of the algorithm. It is shown how algorithms from sorting literature can be used to accomplish this part of the shortest path algorithm. Bounds on the largest possible amount of work are established, and results of a computational study are reported.