Affiliation:
1. Computer Science Department, Whitmore Laboratory, The Pennsylvania State University, University Park, PA
Abstract
Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs. Known results which the results of this paper extend are surveyed briefly and analyzed. A new implementation for priority queues is employed, and a class of “arc set partition” algorithms is introduced. For the single source problem on networks with nonnegative arcs a running time of
O
(min(
n
1+1/
k
+
e
,
n
+
e
) log
n
)) is achieved, where there are
n
nodes and
e
arcs, and
k
is a fixed integer satisfying
k
> 0. This bound is
O
(
e
) on dense networks. For the single source and all pairs problem on unrestricted networks the running time is
O
(min(
n
2+1/
k
+
ne
,
n
2
log
n
+
ne
log
n
).
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference32 articles.
1. AHO A V HOPCROFT J E AND ULLMAN J D The Destgn and Analysts of Computer Algortthms Addison-Wesley Reading Mass 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Destgn and Analysts of Computer Algortthms Addison-Wesley Reading Mass 1974
2. The finite length partial fitted journal bearing with axial oil groove
3. BERGE C Theorle des Graphs et Ses Apphcatlons Dunod Pans 1958 BERGE C Theorle des Graphs et Ses Apphcatlons Dunod Pans 1958
Cited by
652 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献