Random trees : an interplay between combinatorics and probability
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in o...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Cham :
Springer
[20..].
Cham : Springer Nature |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Random trees, an interplay between combinatorics and probability, Michael Drmota, 2009, Wien [etc.], Springer, 1 vol. (XVII-458 p.), 978-3-211-75355-2 |
Obsah:
- Classes of Random Trees Generating Functions Advanced Tree Counting The Shape of Galton-Watson Trees and Pólya Trees The Vertical Profile of Trees Recursive Trees and Binary Search Trees Tries and Digital Search Trees Recursive Algorithms and the Contraction Method Planar Graphs