Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COMBINATORICS
2000

favoriteEmaildiscussreport

112views more COMBINATORICS 2000»

A Note on Random Minimum Length Spanning Trees

13 years 4 months ago

A Note on Random Minimum Length Spanning Trees

Download www.univie.ac.at

Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning tree. We show in this paper that if G is sufficiently highly edge connected then the expected length of a minimum spanning tree is n r (3). If we omit the edge connectivity condition, then it is at most n r ((3) + 1).

Alan M. Frieze, Miklós Ruszinkó, Lub

Real-time Traffic

COMBINATORICS 2000 | Edge | Independent Edge Lengths | R-regular N-vertex Graph |

claim paper

Related Content

» Approximating the Minimum Spanning Tree Weight in Sublinear Time

» Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

» Note on the Structure of Kruskals Algorithm

» Randomized minimum spanning tree algorithms using exponentially fewer random bits

» Randomized Local Search Evolutionary Algorithms and the Minimum Spanning Tree Problem

» Covering minimum spanning trees of random subgraphs

» The Lower Tail of the Random Minimum Spanning Tree

» Efficient minimum spanning tree construction without Delaunay triangulation

» Parametric and Kinetic Minimum Spanning Trees

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COMBINATORICS
Authors	Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma

Comments (0)