Sciweavers

74 search results - page 1 / 15
» Weighted height of random trees
Sort
View
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
13 years 5 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
ACTA
2008
88views more  ACTA 2008»
13 years 4 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
CPC
2008
74views more  CPC 2008»
13 years 5 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
Nicolas Broutin, Luc Devroye
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
13 years 5 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish