Shortest paths in networks with exponentially distributed arc lengths

  title={Shortest paths in networks with exponentially distributed arc lengths},
  author={Vidyadhar G. Kulkarni},
This paper develops methods for the exact computation of the distribution of the length of the shortest path from a given source nodes to a given sink node t in a directed network in which the arc lengths are independent and exponentially distributed random variables. A continuous time Markov chain with a single absorbing state is constructed from the original network such that the time until absorption into this absorbing state starting from the initial state is equal to the length of the… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 31 extracted citations


Publications referenced by this paper.
Showing 1-4 of 4 references

A compact hash function for paths in PERT networks Distribution of the time through a directed acyclic network

A. A. B. Pritsker, J. J. Solberg
Bounds on backtrack algorithms for listing cycles • 1984

An improved conditional Monte Carlo technique for the stochastic shortest route problem

V. G . Adlakha, G. S. Fishman
Technical Report No • 1984

Shortest paths in probabilistic graphs

North Carolina, N. C. Chapel Hill
Operations Res • 1983

Conditional Monte Carlo: A simulation technique for stochastic network analysis

J. M. Burt, M. B. Garman
Management Sci • 1971

Similar Papers

Loading similar papers…