On the height of trees
From MaRDI portal
Cited in
(39)- On exact simulation algorithms for some distributions related to Jacobi theta functions
- The average height of the second highest leaf of a planted plane tree
- Bandwidths and profiles of trees
- On growing random binary trees
- Brownian motion and algorithm complexity
- Finding the two-core of a tree
- The average height of binary trees and other simple trees
- The outer-distance of nodes in random trees
- Simulating theta random variates
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
- The properties of random trees
- On the average number of nodes in a subtree of a tree
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Trees, homology, and automorphism groups of right-angled Artin groups
- Sub-trees of a random tree
- An analysis of budgeted parallel search on conditional Galton-Watson trees
- Scaling limits of random Pólya trees
- The continuum limit of critical random graphs
- On the tree-depth of random graphs
- Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excur\-sions
- Diameter of random spanning trees in a given graph
- Critical random graphs and the structure of a minimum spanning tree
- The distribution of height and diameter in random non-plane binary trees
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- A Random Graph With a Subcritical Number of Edges
- scientific article; zbMATH DE number 3536107 (Why is no real title available?)
- The Distribution of Heights of Binary Trees and Other Simple Trees
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Partition functions of discrete coalescents: from Cayley's formula to Frieze's (3) limit theorem
- Moment of degeneration of a branching process and height of a random tree
- The GHP scaling limit of uniform spanning trees in high dimensions
- Random trees have height \(O(\sqrt{n})\)
- Modal logics of almost-sure validities in some classes of Euclidean and transitive frames
- Random walks and consensus problem on tree network with an identical degree distribution
- Short synchronizing words for random automata
- On random trees obtained from permutation graphs
- Random graphs from a block-stable class
- Low-gate quantum golden collision finding
- Stability in the self-organized evolution of networks
This page was built for publication: On the height of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534022)
