The expected value of random minimal length spanning tree of a complete graph

MaRDI QIDQ2921730zbMATH OpenFDO

Authors David Gamarnik

Publication date 13 October 2014

Mathematics Subject Classification ID

Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 1984546
• On the length of a random minimum spanning tree
• On the value of a random minimum spanning tree problem
• On random minimum length spanning trees
• scientific article; zbMATH DE number 4056658

Cited in

(11)

• A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
• The Expected Length of a Minimal Spanning Tree of a Cylinder Graph
• On the difference of expected lengths of minimum spanning trees
• scientific article; zbMATH DE number 4056658 (Why is no real title available?)
• scientific article; zbMATH DE number 1984546 (Why is no real title available?)
• scientific article; zbMATH DE number 2066194 (Why is no real title available?)
• Polynomial representation for the expected length of minimal spanning trees
• On the length of a random minimum spanning tree
• The expected degree of minimal spanning forests
• Expected lengths of minimum spanning trees for non-identical edge distributions
• Expected values of parameters associated with the minimum rank of a graph

This page was built for publication: The expected value of random minimal length spanning tree of a complete graph

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