The expected length of a shortest path (Q1261487)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The expected length of a shortest path |
scientific article; zbMATH DE number 404998
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The expected length of a shortest path |
scientific article; zbMATH DE number 404998 |
Statements
The expected length of a shortest path (English)
0 references
27 March 1994
0 references
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.
0 references
graphs with random arc lengths
0 references
expected length of shortest paths
0 references
