Size and Weight of Shortest Path Trees with Exponential Link Weights

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)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Distribution of Minimal Path Lengths when Edge Lengths are Independent Heterogeneous Exponential Random Variables ⋮ \(r\)-Lah distribution: properties, limit theorems and an application to compressed sensing ⋮ Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance ⋮ The Blind Passenger and the Assignment Problem ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ The Longest Minimum-Weight Path in a Complete Graph ⋮ Weight of a link in a shortest path tree and the Dedekind Eta function ⋮ The weight of the shortest path tree

This page was built for publication: Size and Weight of Shortest Path Trees with Exponential Link Weights