Results 261 to 270 of about 68,890 (299)
Some of the next articles are maybe not open access.
1994
We investigate the problem of transforming one binary tree into another by rotatoins, subject to certain weight ocnstraints on the nodes of the trees. These constraints arise in the problem of "morphing" one simple polygon to another simple polygon by continuous deformatinos (translations and scalings) that preserve the turn angles and the simplicity ...
Hershberger, John, Suri, Subhash
openaire +3 more sources
We investigate the problem of transforming one binary tree into another by rotatoins, subject to certain weight ocnstraints on the nodes of the trees. These constraints arise in the problem of "morphing" one simple polygon to another simple polygon by continuous deformatinos (translations and scalings) that preserve the turn angles and the simplicity ...
Hershberger, John, Suri, Subhash
openaire +3 more sources
Journal of Algorithms, 1985
Summary: In this paper the problem of generating all binary trees, as represented by well-formed parentheses strings, in such a way that the changes in successively generated trees are constant is discussed. In particular, an algorithm is developed that generates the strings by simply interchanging a left and a right parenthesis. It is also proven that
Andrzej Proskurowski, Frank Ruskey
openaire +2 more sources
Summary: In this paper the problem of generating all binary trees, as represented by well-formed parentheses strings, in such a way that the changes in successively generated trees are constant is discussed. In particular, an algorithm is developed that generates the strings by simply interchanging a left and a right parenthesis. It is also proven that
Andrzej Proskurowski, Frank Ruskey
openaire +2 more sources
Binary-Tree Histograms with Tree Indices
2002In many application contexts, like statistical databases, transaction recording systems, scientific databases, query optimizers, OLAP, and so on, data are summarized as histograms of aggregate values. When the task of reconstructing range queries on original data from aggregate data is performed, a certain estimation error cannot be avoided, due to the
BUCCAFURRI F. +3 more
openaire +3 more sources
Graphs That are Almost Binary Trees
SIAM Journal on Computing, 1982This paper studies embeddings of graphs in binary trees. The cost of such an embedding is the maximum distance in the binary tree between images of adjacent graph vertices. Several techniques for bounding the costs of such embeddings from above are derived; notable among these is an algorithm for embedding any outerplanar graph in a binary tree with a ...
Jia-Wei Hong, Arnold L. Rosenberg
openaire +1 more source
Proceedings of the annual conference on - ACM 76, 1976
Family pedigree data as required by genetics has proven to be difficult to analyze. This paper presents a data collection and structuring technique developed for the program PDGRE, which significantly improves on past computer application performances and produces a binary tree representation for the data.
openaire +1 more source
Family pedigree data as required by genetics has proven to be difficult to analyze. This paper presents a data collection and structuring technique developed for the program PDGRE, which significantly improves on past computer application performances and produces a binary tree representation for the data.
openaire +1 more source
The Fermat star of binary trees
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LUCCIO, FABRIZIO, PAGLI, LINDA
openaire +3 more sources
On Rotations and the Generation of Binary Trees
Journal of Algorithms, 1993Summary: The rotation graph, \(G_ n\), has vertex set consisting of all binary trees with \(n\) nodes. Two vertices are connected by an edge if a single rotation will transform one tree into the other. We provide a simpler proof of a result of {\t J. M. Lucas} [J. Algorithms 8, 503-535 (1987; Zbl 0641.05015)] that \(G_ n\) contains a Hamilton path. Our
Joan M. Lucas +2 more
openaire +1 more source
On the Average Shape of Binary Trees
SIAM Journal on Algebraic Discrete Methods, 1980The average level numbers of the leaves of a binary tree are studied, where each binary tree is regarded as being equally likely. A formula is derived for the number of binary trees with jth leaf at a prescribed level. The asymptotic behavior of the average level number of the jth leaf is determined.
openaire +1 more source
COMPUTABILITY IN UNCOUNTABLE BINARY TREES
The Journal of Symbolic Logic, 2019Abstract Computability, while usually performed within the context of ω, may be extended to larger ordinals by means of α-recursion. In this article, we concentrate on the particular case of ω1-recursion, and study the differences in the behavior of ${\rm{\Pi }}_1^0$ -classes between this case and the standard one.
openaire +1 more source
On Universal Binary Search Trees
Fundamenta Informaticae, 1981The paper deals with the problem of constructing binary search trees that are available in the case of unknown or time varying access probabilities.
openaire +2 more sources