Add to ORKGWe characterize the path length set of asymmetric binary fractal trees in terms of the scaling ratios, r and ℓ. We show that if r + ℓ \u3c 1, then the path length set is a Cantor set, and if r + ℓ ≥ 1, then the path length set is an interval. © World Scientific Publishing Company
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who ...
AbstractAn asymmetrizing set of a tree T is a set A of vertices of T such that the identity is the o...
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who ...
of analyzing the left and the right path length in a random binary trees. In particular, Knuth asked...
AbstractA structure is said to be asymmetric if its automorphism group reduces to the identity. We p...
AbstractSome asymptotic results about the sizes of certain sets of hereditarily finite sets, identit...
We consider extended binary trees and study the common right and left depth of leaf j, where the lea...
In this paper we discuss asymmetric length structures and asymmetric metric spaces. A length structu...
Many other applications of the structure of fractal trees are found in [5–9]. Mathematically, these ...
We study numerically a non-linear integral equation that arises in the study of binary search trees....
We relate the fractal dimension of the backbone, and the spectral dimension of Eden trees to the dyn...
Lengths of all caves in a region have been observed previously to be distributed hyperbolically, lik...
This paper studies path lengths in random binary search trees under the random permutation model. It...
Define the average path length in a connected graph as the sum of the length of the shortest path be...
AbstractWe introduce the m-ary interval tree, a random structure that underlies interval division an...
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who ...
AbstractAn asymmetrizing set of a tree T is a set A of vertices of T such that the identity is the o...
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who ...
of analyzing the left and the right path length in a random binary trees. In particular, Knuth asked...
AbstractA structure is said to be asymmetric if its automorphism group reduces to the identity. We p...
AbstractSome asymptotic results about the sizes of certain sets of hereditarily finite sets, identit...
We consider extended binary trees and study the common right and left depth of leaf j, where the lea...
In this paper we discuss asymmetric length structures and asymmetric metric spaces. A length structu...
Many other applications of the structure of fractal trees are found in [5–9]. Mathematically, these ...
We study numerically a non-linear integral equation that arises in the study of binary search trees....
We relate the fractal dimension of the backbone, and the spectral dimension of Eden trees to the dyn...
Lengths of all caves in a region have been observed previously to be distributed hyperbolically, lik...
This paper studies path lengths in random binary search trees under the random permutation model. It...
Define the average path length in a connected graph as the sum of the length of the shortest path be...
AbstractWe introduce the m-ary interval tree, a random structure that underlies interval division an...
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who ...
AbstractAn asymmetrizing set of a tree T is a set A of vertices of T such that the identity is the o...
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who ...