B. L. Fox: "Data Structures and Computer Science Techniques in Operations Research", Operations Research, vol. 26, no. 5, pp. 686--717. (1978) Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Algorithm for Efficient Computation of K Shortest Paths - Jimenez, Marzal (1994) (1 citation) (Correct)
....similar to the Bellman Ford algorithm. Dreyfus [Drey69] extended the Bellman Kalaba equations to the general case and proposed important improvements to the method of resolution. The time complexity of the Dreyfus algorithm is O(A K Delta jV j Delta log d) where d is the maximum input degree [Fox73, Fox78]. This algorithm computes the K shortest paths from s to all the nodes in V (even if we are interested only in the K shortest paths from s to t) Therefore, its best case time complexity is Omega Gamma A K Delta jV j) Shier proposed in [Shie76, Shie79] several methods for the computation of ....
B. L. Fox: "Data Structures and Computer Science Techniques in Operations Research", Operations Research, vol. 26, no. 5, pp. 686--717. (1978)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC