Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
278,181
Simulating Binary Trees on Hypercubes
- in: Proceedings Third Aegan Workshop on Computing, Lecture Notes Computer Science 319
, 1988
"... We give a dilation 3 embedding, with O(1) expansion, of every binary tree into a hypercube. Moreover, we describe an embedding of an arbitrary binary tree into its optimum hypercube with dilation 6. 1 ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
We give a dilation 3 embedding, with O(1) expansion, of every binary tree into a hypercube. Moreover, we describe an embedding of an arbitrary binary tree into its optimum hypercube with dilation 6. 1
Width of a Binary Tree
"... Till current date in majority books on algorithm and research papers, they talk about height of a binary tree in terms like height balanced binary tree. In this paper the notion of width of a binary tree has been introduced and later the recursive algorithm based on the traversal techniques of the b ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Till current date in majority books on algorithm and research papers, they talk about height of a binary tree in terms like height balanced binary tree. In this paper the notion of width of a binary tree has been introduced and later the recursive algorithm based on the traversal techniques
On Rotations and the Generation of Binary Trees
- J. Algorithms
, 1993
"... 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 Lucas [7] that G n contains a Hamilton path. Our proof deals directly wi ..."
Abstract
-
Cited by 39 (6 self)
- Add to MetaCart
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 Lucas [7] that G n contains a Hamilton path. Our proof deals directly
On Embedding Binary Trees into Hypercubes
, 1997
"... Hypercubes are known to be able to simulate other structures such as grids and binary trees. It has been shown that an arbitrary binary tree can be embedded into a hypercube with constant expansion and constant dilation. This paper presents a simple linear-time heuristic which embeds an arbitrary b ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
Hypercubes are known to be able to simulate other structures such as grids and binary trees. It has been shown that an arbitrary binary tree can be embedded into a hypercube with constant expansion and constant dilation. This paper presents a simple linear-time heuristic which embeds an arbitrary
Wiener Indices of Binary Trees
"... One of the most widely known topological index is the Wiener index. The Wiener Index Conjecture states that all positive integer numbers except a finite set are the Wiener indices of some trees. We explore the Wiener indices of the binary trees. We present efficient algorithms for generating the Wie ..."
Abstract
- Add to MetaCart
One of the most widely known topological index is the Wiener index. The Wiener Index Conjecture states that all positive integer numbers except a finite set are the Wiener indices of some trees. We explore the Wiener indices of the binary trees. We present efficient algorithms for generating
Pattern avoidance in binary trees
- J. Combin. Theory, Ser. A
"... Abstract. This paper introduces the notion of pattern avoidance in binary trees. We provide an algorithm for computing the generating function that counts the number of n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf eq ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
Abstract. This paper introduces the notion of pattern avoidance in binary trees. We provide an algorithm for computing the generating function that counts the number of n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf
Characteristic Inequalities for Binary Trees
"... In a binary tree T of N leaves, the left (right) level l i (r i ) of leaf i is the number of left (right) edges in path from the root to that leaf. The level n i of leaf i is n i = l i +r i . Kraft-McMillan's characteristic inequality gives a necessary and sufficient condition for a multiset of ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
In a binary tree T of N leaves, the left (right) level l i (r i ) of leaf i is the number of left (right) edges in path from the root to that leaf. The level n i of leaf i is n i = l i +r i . Kraft-McMillan's characteristic inequality gives a necessary and sufficient condition for a multiset
On Defining Functions on Binary Trees
, 1993
"... This article is a continuation of an article on defining functions on trees (see [7]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
This article is a continuation of an article on defining functions on trees (see [7]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme
On the Euclidean distortion of complete binary trees
, 2001
"... Bourgain [1] showed that every embedding of the complete binary tree of depth ..."
Abstract
-
Cited by 19 (5 self)
- Add to MetaCart
Bourgain [1] showed that every embedding of the complete binary tree of depth
Generating Binary Trees by Transpositions
- Journal of Algorithms
, 1995
"... Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every prefix the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms for generating the elements of T(n) that ..."
Abstract
-
Cited by 22 (4 self)
- Add to MetaCart
Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every prefix the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms for generating the elements of T
Results 1 - 10
of
278,181
