Key points are not available for this paper at this time.
We describe a new method for designing scaling algorithms for the single-source shortest paths problem and use this method to obtain an O (nm N) algorithm for the problem. (Here n and m are the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length; arc lengths are assumed to be integral. ) This improves previous bounds for the problem. The method extends to related problems.
Andrew V. Goldberg (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: