Shedding new light on random trees
We introduce a weighted model of random trees and analyze the asymptotic properties of their heights. Our framework encompasses most trees of logarithmic height that were introduced in the context of the analysis of algorithms or combinatorics. This allows us to state a sort of "master theorem&...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
2007
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=102963 |