On the height of trees
From MaRDI portal
Publication:5534022
DOI10.1017/S1446788700004432zbMath0153.25802OpenAlexW2159376684MaRDI QIDQ5534022
Publication date: 1967
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446788700004432
Related Items
On growing random binary trees, Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem, Brownian motion and algorithm complexity, Diameter of random spanning trees in a given graph, Finding the two-core of a tree, The distribution of height and diameter in random non-plane binary trees, Low-gate quantum golden collision finding, Unnamed Item, Stability in the self-organized evolution of networks, Simulating theta random variates, The Distribution of Heights of Binary Trees and Other Simple Trees, Moment of degeneration of a branching process and height of a random tree, Scaling limits of random Pólya trees, The continuum limit of critical random graphs, The GHP scaling limit of uniform spanning trees in high dimensions, Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees, On the tree-depth of random graphs, A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks, Heavy subtrees of Galton-Watson trees with an application to Apollonian networks, The average height of binary trees and other simple trees, The outer-distance of nodes in random trees, On the Most Probable Shape of a Search Tree Grown from a Random Permutation, Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions, Trees, homology, and automorphism groups of right-angled Artin groups, Sub-trees of a random tree, Critical random graphs and the structure of a minimum spanning tree, On random trees obtained from permutation graphs, Random graphs from a block-stable class, An analysis of budgeted parallel search on conditional Galton-Watson trees, The properties of random trees, On exact simulation algorithms for some distributions related to Jacobi theta functions, A Random Graph With a Subcritical Number of Edges, On the average number of nodes in a subtree of a tree, The average height of the second highest leaf of a planted plane tree, Bandwidths and profiles of trees
Cites Work
