An empirical study of the structure of the shortest path tree

MaRDI QIDQ2811605zbMATH OpenFDO

Authors Irmantas Radavičius, Mindaugas Bloznelis

Publication date 10 June 2016

Published in Lietuvos Matematikos Rinkinys. Lietuvos Matematiku Draugijos Darbai (Search for Journal in Brave)

zbMATH Keywords

weighted graphrandom weightsshortest path tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22) Paths and cycles (05C38)

Recommendations

• The weight of the shortest path tree
• Size and Weight of Shortest Path Trees with Exponential Link Weights
• scientific article; zbMATH DE number 3846542
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• On random minimum length spanning trees

Cited in

(6)

• Generalized shortest path trees: a novel graph class by example of semiotic networks
• Shortest shortest path trees of a network
• Size and Weight of Shortest Path Trees with Exponential Link Weights
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Network-Tree Model and Shortest Path Algorithm
• Weight of a link in a shortest path tree and the Dedekind eta function

This page was built for publication: An empirical study of the structure of the shortest path tree

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