G. Polya, Kombinatorische Anzahlbestimmungen fu .. r Graphen, Gruppen und Chemische Verbindungen, Acta Mathematica 68 (1937), 145-254. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Some New Methods and Results in Tree Enumeration - Odlyzko (1984) (1 citation) (Correct)
....to classical tree enumeration, where the generating functions typically have only algebraic singularities. To oversimplify a little, it can be said that at least asymptotic enumeration of unlabeled trees of various kinds is very well understood. The basic method used there was developed by Polya [32] and perfected by Otter [31] Their method is presented also in [16] and it is so well understood that a few years ago a paper was written with the title Twenty step algorithm for determining the asymptotic number of trees of various species [17] The word algorithm in the title of that ....
G. Polya, Kombinatorische Anzahlbestimmungen fu .. r Graphen, Gruppen und Chemische Verbindungen, Acta Mathematica 68 (1937), 145-254.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC