Arbres pour l'algorithmique / Brigitte Chauvin, Julien Clément, Danièle Gardy
Type de document : MonographieCollection : Mathématiques et applications, 83Langue : anglais.Pays: Swisse.Éditeur : Cham : Springer, 2018Description : 1 vol. (XXXI-513 p.) : fig. ; 24 cmISBN: 9783319937243.ISSN: 1154-483X.Bibliographie : Bibliogr. p. 495-504. Index.Sujet MSC : 05Cxx, Combinatorics - Graph theory60C05, Probability theory and stochastic processes, Combinatorial probability
60J80, Probability theory and stochastic processes - Markov processes, Branching processes (Galton-Watson, birth-and-death, etc.)
68Pxx, Computer science - Theory of data
68Wxx, Computer science - Algorithms in computer scienceEn-ligne : zbMath | MSN | Hal
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Monographie
|
CMI Salle 1 | Séries SMA (Browse shelf(Opens below)) | Available | 09516-01 |
Bibliogr. p. 495-504. Index
Publisher’s description: This book presents a wide range of tree structures, from both a computer science and a mathematical point of view. For each of these structures we give the algorithms that allow us to visit or update the structure, and discuss their potential uses, either directly (for storing data) or in modelling a variety of situations. We present a mathematical approach to their performances; this is done by the systematic and parallel use of tools from discrete mathematics, probability and analytic combinatorics. The book is intended for graduate students in mathematics or computer science (or both) and in engineering schools. It is also suitable for anyone with a basic level of scientific knowledge who may have to use tree structures and related algorithms, and who wishes to get a rigorous knowledge of their performance without going back to the original, often specialized, results.
There are no comments on this title.