On Shortest Paths in Graphs with Random Weights

DOI10.1287/moor.10.4.557zbMath0578.05041MaRDI QIDQ3699721

Refael Hassin, Eitan Zemel

Publication date: 1985

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/593.pdf

zbMATH Keywords

random graphs; diameter; shortest paths

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C38: Paths and cycles

Related Items

Finding real-valued single-source shortest paths in o(n 3) expected time, Unnamed Item, A Forward-Backward Single-Source Shortest Paths Algorithm, Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs, The value of side information in network flow optimization, Random shortest paths: non-Euclidean instances for metric optimization problems, The expected length of a shortest path, All-pairs shortest paths and the essential subgraph, Extreme value distributions for two kinds of path sums of Markov chain, Minimum-weight combinatorial structures under random cost-constraints, On the longest path of a randomly weighted tournament, Probabilistic analysis of optimization problems on generalized random shortest path metrics, Distribution of Minimal Path Lengths when Edge Lengths are Independent Heterogeneous Exponential Random Variables