The expected length of a shortest path
The object under consideration is a directed complete graph whose arc lengths are independent and exponentially distributed with parameter \(\mu\). For the expected length of a shortest path an easily -- computable summation formula and a closed -- form approximation function are given. Also experimental validation of this result is given.
scientific article; zbMATH DE number 404998