Analysis of three graph parameters for random trees
- 7 January 2009
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 35 (1) , 42-69
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Systems of functional equationsRandom Structures & Algorithms, 2000
- Normal convergence problem? Two moments and a recurrence may be the cluesThe Annals of Applied Probability, 1999
- On Convergence Rates in the Central Limit Theorems for Combinatorial StructuresEuropean Journal of Combinatorics, 1998
- On the asymptotic behavior of the independence number of a random (n, n)-treeGraphs and Combinatorics, 1996
- The Continuum random tree II: an overview1991
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Path node-covering constants for certain families of treesMathematical Proceedings of the Cambridge Philosophical Society, 1978
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978