On average edge length of minimum spanning trees

DOI10.1016/S0020-0190(99)00068-XzbMATH Open0990.05031OpenAlexW2043013671MaRDI QIDQ1606949FDOQ1606949

Authors: Suman Kumar Nath, Rezaul Alam Chowdhury, Mohammad Kaykobad 

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00068-x

Recommendations

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

zbMATH Keywords

minimum spanning tree

Mathematics Subject Classification ID

Trees (05C05)

Cited In (4)

• On family of graphs with minimum number of spanning trees
• A tight bound on the collection of edges in MSTs of induced subgraphs
• On minimum average stretch spanning trees in grid graphs
• The Expected Length of a Minimal Spanning Tree of a Cylinder Graph

This page was built for publication: On average edge length of minimum spanning trees

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