Size and Weight of Shortest Path Trees with Exponential Link Weights
From MaRDI portal
Publication:3419768
DOI10.1017/S0963548306007802zbMath1160.05338MaRDI QIDQ3419768
Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem
Publication date: 7 February 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance, \(r\)-Lah distribution: properties, limit theorems and an application to compressed sensing, Random shortest paths: non-Euclidean instances for metric optimization problems, The Blind Passenger and the Assignment Problem, Weight of a link in a shortest path tree and the Dedekind Eta function, Distribution of Minimal Path Lengths when Edge Lengths are Independent Heterogeneous Exponential Random Variables, The weight of the shortest path tree, The Longest Minimum-Weight Path in a Complete Graph