Two languages for estimating program efficiency
Communications of the ACM
Algorithms for shortest paths.
Algorithms for shortest paths.
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Alternative formulations of the paging problem for cache with read through
ACM-SE 17 Proceedings of the 17th annual Southeast regional conference
A global router based on a multicommodity flow model
Integration, the VLSI Journal
Accelerating the neighbor-joining algorithm using the adaptive bucket data structure
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
| Hi-index | 0.00 |
An algorithm (FLOW) for finding the shortest distance from a given node S to each node X of a directed graph with nonnegative integer arc lengths less than or equal to WM is presented. FLOW is compared with its best-known competitor, that of Dijkstra and Yen (DFLO). The new algorithm is shown to execute in time of order max (V, E, D), where D is the maximum distance computed in a graph with E edges and V nodes. By counting the number of operands fetched during execution of FLOW and DFLO, an estimate of the running time of each is obtained. This estimate shows that FLOW should execute faster than DFLO when E/V2 = &agr; V ≥ 22 WM/&bgr; + 5/&bgr; + 7.04, where &bgr; = 23 - 80&agr;. FLOW also will solve the all-pairs shortest distance problem, requiring time O(V * max(V, E, D)) for the solution.