74 search results - page 3 / 15 » The Lower Tail of the Random Minimum Spanning Tree |
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
COMBINATORICS
2000
14 years 11 months ago
2000
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...
104
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
107
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...