The weight of the shortest path tree

DOI10.1002/RSA.20141zbMATH Open1117.05103OpenAlexW4249197767MaRDI QIDQ3437022FDOQ3437022

Authors: Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem 

Publication date: 11 May 2007

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:c7dbeaeb-af0a-4bca-9d67-f9a9fd96239c

Recommendations

• Size and Weight of Shortest Path Trees with Exponential Link Weights
• An empirical study of the structure of the shortest path tree
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• The longest minimum-weight path in a complete graph
• On the value of a random minimum weight Steiner tree

zbMATH Keywords

central limit theoremGaussian distributionprobabilityrandom link weights

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Central limit and other weak theorems (60F05)

Cites Work

• Title not available (Why is that?)
• Size and Weight of Shortest Path Trees with Exponential Link Weights

Cited In (8)

• The longest minimum-weight path in a complete graph
• ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES
• Shortest-weight paths in random regular graphs
• The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
• The mean field traveling salesman and related problems
• Size and Weight of Shortest Path Trees with Exponential Link Weights
• An empirical study of the structure of the shortest path tree
• Weight of a link in a shortest path tree and the Dedekind eta function

This page was built for publication: The weight of the shortest path tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437022)