A note on random minimum length spanning trees
From MaRDI portal
Publication:1578476
zbMath0958.05123MaRDI QIDQ1578476
Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
Publication date: 14 September 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120866
Related Items (10)
A concentration inequality for the facility location problem ⋮ Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023 ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ On the Length of a Random Minimum Spanning Tree ⋮ Minimum Cost Matching in a Random Graph with Random Costs ⋮ A randomly weighted minimum spanning tree with a random cost constraint ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ The Effect of Adding Randomly Weighted Edges ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights
This page was built for publication: A note on random minimum length spanning trees
