Add to ORKGAn efficient recursive algorithm has been developed to generate binary trees in B-order from 0-1 sequences. The generation algorithm produces each tree in constant average time O(1). The ranking and unranking algorithms with O(n) time complexity are also presented
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractIn this paper, we consider a transformation on binary trees using new types of rotations. Ea...
An efficient recursive algorithm has been developed to generate binary trees in B-order from 0-1 seq...
In this paper, we present two new ranking and unranking algorithms for k-ary trees represented by x-...
An isomorphism between stack permutations of a set of n elements and ordered binary trees with n ver...
A linear time and space algorithm for construction of a binary tree from the pre-order and post-orde...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algori...
International audienceA binary unordered tree is a tree where each internal node has two children an...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees and left as open probl...
In this paper, we present a new generation algorithm with corresponding ranking and unranking algori...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractIn this paper, we consider a transformation on binary trees using new types of rotations. Ea...
An efficient recursive algorithm has been developed to generate binary trees in B-order from 0-1 seq...
In this paper, we present two new ranking and unranking algorithms for k-ary trees represented by x-...
An isomorphism between stack permutations of a set of n elements and ordered binary trees with n ver...
A linear time and space algorithm for construction of a binary tree from the pre-order and post-orde...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of...
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algori...
International audienceA binary unordered tree is a tree where each internal node has two children an...
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees and left as open probl...
In this paper, we present a new generation algorithm with corresponding ranking and unranking algori...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
We present a linear-time sequential algorithm for the construction of a binary tree, given its preor...
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
AbstractA new algorithm for generating all ordered trees on n nodes, is developed. It is a nonrecurs...
AbstractIn this paper, we consider a transformation on binary trees using new types of rotations. Ea...