Geodesic
Enumeration of Trees
Séminaire lotharingien de combinatoire, Tome 25 (1990)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

Enumeration of trees is a more and more rapidly growing area of enumerative Combinatorics, especially since a number of problems in Computer Science, e.g. in the average case analysis of data structures and algorithms, involve the task to enumerate trees of a specified kind.

It is the aim of this article to survey some of the most important methods and results in this area. Of course by no means we can give a complete overview. Neverthelesswe hope that the selection of problems and methods might be helpful.

This article contains explicit combinatorial enumeration formulae as well as asymptotic results: in fact it turns out that in many problems of practical interest the latter kind of results is either the only one that can be achieved or even the preferable one for the interpretation of final results. 

@article{SLC_1990_25_a11,
     author = {Peter Kirschenhofer},
     title = {Enumeration of {Trees}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {25},
     year = {1990},
     url = {http://geodesic.mathdoc.fr/item/SLC_1990_25_a11/}
}
TY  - JOUR
AU  - Peter Kirschenhofer
TI  - Enumeration of Trees
JO  - Séminaire lotharingien de combinatoire
PY  - 1990
VL  - 25
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1990_25_a11/
ID  - SLC_1990_25_a11
ER  - 
%0 Journal Article
%A Peter Kirschenhofer
%T Enumeration of Trees
%J Séminaire lotharingien de combinatoire
%D 1990
%V 25
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1990_25_a11/
%F SLC_1990_25_a11
Peter Kirschenhofer. Enumeration of Trees. Séminaire lotharingien de combinatoire, Tome 25 (1990). http://geodesic.mathdoc.fr/item/SLC_1990_25_a11/