In a recent paper [4], Minieka proposes an algorithm for finding kth shortest paths between all pairs of nodes in an N node network. His claimed time is O(k2N3).
B. L. Fox
Author Archives
It is shown how a novel method for computing (related) inner products can accelerate the pricing phase of LP algorithms. Other LP applications are indicated.
An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix is presented. Applications in Markov renewal programming and in the…
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved