On Finding the Expected Length of a Random Minimal Tree

DOI10.1137/1133056zbMATH Open0672.60017OpenAlexW2068102791MaRDI QIDQ3825829FDOQ3825829

Authors:

Publication date: 1988

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1133056

zbMATH Keywords

asymptotic of the expectation of the length of the minimal treecomplete unoriented graph

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited In (2)

• Asymptotics for Euclidean minimal spanning trees on random points
• On finding a minimum spanning tree in a network with random weights

This page was built for publication: On Finding the Expected Length of a Random Minimal Tree

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