169 search results - page 1 / 34 » On the Number of t-Ary Trees with a Given Path Length |
ALGORITHMICA
2006
13 years 4 months ago
2006
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
DAM
2000
13 years 4 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
FODO
1989
Springer
13 years 9 months ago
1989
Springer
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
RSA
2011
12 years 7 months ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...