Results 1  10
of
34
Tree Traversals and Permutations
"... We build upon the previous work on the subset of permutations known as stack words and stacksortable words. We use preorder, inorder and postorder traversals of binary trees to establish multiple bijections between binary trees and these words. We show these operators satisfy a sort of multiplicati ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We build upon the previous work on the subset of permutations known as stack words and stacksortable words. We use preorder, inorder and postorder traversals of binary trees to establish multiple bijections between binary trees and these words. We show these operators satisfy a sort
Using postordering and static symbolic factorization for parallel sparse LU
 In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS
, 2000
"... In this paper we present several improvements of widely used parallel LU factorization methods on sparse matrices. First we introduce the LU elimination forest and then we characterize the L, U factors in terms of their corresponding LU elimination forest. This characterization can be used as a comp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
compact storage scheme of the matrix as well as of the task dependence graph. To improve the use of BLAS in the numerical factorization, we perform a postorder traversal of the LU elimination forest, thus obtaining larger supernodes. To expose more task parallelism for a sparse matrix, we build a more
OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PREORDER AND POSTORDER TRAVERSALS
"... A linear time and space algorithm for construction of a binary tree from the preorder and postorder traversals is presented. The solution is not always unique. The number of solutions is calculated and an optimal time and space method to find all the solutions is shown. ..."
Abstract
 Add to MetaCart
A linear time and space algorithm for construction of a binary tree from the preorder and postorder traversals is presented. The solution is not always unique. The number of solutions is calculated and an optimal time and space method to find all the solutions is shown.
PREPRINT. Information Processing Letters, 34(1):2125, 1990. Construction of a Tree from its Traversals in Optimal Time and Space
"... Abstract Given the preorder traversal of a tree together with some additional structure information, the tree can be constructed in linear time with a simple algorithm. The additional information may be the inorder or postorder traversal. In one case, the binary search tree, no additional informatio ..."
Abstract
 Add to MetaCart
Abstract Given the preorder traversal of a tree together with some additional structure information, the tree can be constructed in linear time with a simple algorithm. The additional information may be the inorder or postorder traversal. In one case, the binary search tree, no additional
Reconstructing a Binary Tree from its Traversals in DoublyLogarithmic CREW Time
"... We consider the following problem. For a binary tree T = (V; E) where V = f1; 2; :::; ng, given its inorder traversal and either its preorder or its postorder traversal, reconstruct the binary tree. We present a new parallel algorithm for this problem. Our algorithm requires O(n) space. The main i ..."
Abstract
 Add to MetaCart
We consider the following problem. For a binary tree T = (V; E) where V = f1; 2; :::; ng, given its inorder traversal and either its preorder or its postorder traversal, reconstruct the binary tree. We present a new parallel algorithm for this problem. Our algorithm requires O(n) space. The main
PARSING AS TREE TRAVERSAL
"... ABSTRACT This paper presents a unified approach to parsing, in which topdown, bottomup and leftcorner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottomup and leftcorner parsers are left recursive and must be converted using an extended G ..."
Abstract
 Add to MetaCart
ABSTRACT This paper presents a unified approach to parsing, in which topdown, bottomup and leftcorner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottomup and leftcorner parsers are left recursive and must be converted using an extended
Kumar S: “Modified NonRecursive Algorithm for Reconstructing a Binary Tree from its Traversals”, IJCA, volume 43No.10
, 2012
"... Binary tree traversal refers to the process of visiting each node in a specified order. Given the inorder traversal of a binary tree, along with one of its preorder or postorder traversals, the original binary tree can be uniquely identified. Many recursive and non recursive method of construction o ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Binary tree traversal refers to the process of visiting each node in a specified order. Given the inorder traversal of a binary tree, along with one of its preorder or postorder traversals, the original binary tree can be uniquely identified. Many recursive and non recursive method of construction
396 ABSTRACT PARSING AS TREE TRAVERSAL
"... This paper presents a unified approach to parsing, in which topdown, bottomup and leftcorner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottomup and leftcorner parsers are left recursive and must be converted using an extended Greibac ..."
Abstract
 Add to MetaCart
This paper presents a unified approach to parsing, in which topdown, bottomup and leftcorner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottomup and leftcorner parsers are left recursive and must be converted using an extended
Automatic relation triple extraction by dependency parse tree traversing
, 2008
"... Abstract. To use the information on the web pages effectively, one of the methods is to annotate them to meet with ontology. This paper focuses on the technology of extracting relation triplets automatically by traversing dependency parse tree of a sentence in postorder manner, to build ontology fro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. To use the information on the web pages effectively, one of the methods is to annotate them to meet with ontology. This paper focuses on the technology of extracting relation triplets automatically by traversing dependency parse tree of a sentence in postorder manner, to build ontology
On optimal tree traversals for sparse matrix factorization
 In IPDPS’2011, the 25th IEEE International Parallel and Distributed Processing Symposium. IEEE Computer
, 2011
"... Abstract—We study the complexity of traversing treeshaped workflows whose tasks require large I/O files. Such workflows typically arise in the multifrontal method of sparse matrix factorization. We target a classical twolevel memory system, where the main memory is faster but smaller than the seco ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
amount of main memory, over all postorder schemes, or over all possible traversals, that is needed for an incore execution? We establish several complexity results that answer these questions. We propose a new, polynomial time, exact algorithm which runs faster than a reference algorithm. Next, we
Results 1  10
of
34