The shortest-path problem for graphs with random arc-lengths
Open Access
- 31 January 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (1) , 57-77
- https://doi.org/10.1016/0166-218x(85)90059-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Random contact processes, snowball sampling and factorial series distributionsJournal of Applied Probability, 1983
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- Stochastic RumoursIMA Journal of Applied Mathematics, 1965
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959