The following pages link to On the height of trees (Q5534022):
Displayed 24 items.
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Moment of degeneration of a branching process and height of a random tree (Q600177) (← links)
- Stability in the self-organized evolution of networks (Q848641) (← links)
- On exact simulation algorithms for some distributions related to Jacobi theta functions (Q1036738) (← links)
- The average height of the second highest leaf of a planted plane tree (Q1058519) (← links)
- Bandwidths and profiles of trees (Q1073038) (← links)
- On growing random binary trees (Q1076401) (← links)
- Brownian motion and algorithm complexity (Q1082076) (← links)
- Finding the two-core of a tree (Q1086244) (← links)
- The average height of binary trees and other simple trees (Q1171885) (← links)
- The outer-distance of nodes in random trees (Q1173095) (← links)
- Simulating theta random variates (Q1359731) (← links)
- The properties of random trees (Q1825678) (← links)
- On the average number of nodes in a subtree of a tree (Q1838491) (← links)
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees (Q1951700) (← links)
- The continuum limit of critical random graphs (Q2428503) (← links)
- Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions (Q2750962) (← links)
- Diameter of random spanning trees in a given graph (Q2891037) (← links)
- Critical random graphs and the structure of a minimum spanning tree (Q3055778) (← links)
- The distribution of height and diameter in random non-plane binary trees (Q3165458) (← links)
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation (Q3310623) (← links)
- A Random Graph With a Subcritical Number of Edges (Q3807259) (← links)
- (Q4111582) (← links)
- The Distribution of Heights of Binary Trees and Other Simple Trees (Q4290085) (← links)