Results 1  10
of
661
Dynamic parallel tree contraction
 In Proceedings 5th Annual ACM Symp. on Parallel Algorithms and Architectures
, 1994
"... Parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph algorithms. We propose a corresponding technique for the parallel solution of problems with incremental changes in the data. In dynamic tree contraction problems, we are ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph algorithms. We propose a corresponding technique for the parallel solution of problems with incremental changes in the data. In dynamic tree contraction problems, we
Optimal Tree Contraction in the EREW Model
, 1988
"... A deterministic parallel algorithm for parallel tree contraction is presented in this paper. The algorithm takes T time and uses (P processors, where n the number of vertices in a tree using an Exclusive Read and Exclusive Write (EREW) Parallel Random Access Machine (PRAM). This algorithm improves t ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
A deterministic parallel algorithm for parallel tree contraction is presented in this paper. The algorithm takes T time and uses (P processors, where n the number of vertices in a tree using an Exclusive Read and Exclusive Write (EREW) Parallel Random Access Machine (PRAM). This algorithm improves
Parallel TreeContraction and Fibonacci Numbers
"... We show a new property of Fibonacci numbers which is related to the analysis of a very simple and natural parallel tree contraction algorithm. We show that the size of the smallest tree which requires t contractions equals exactly the tth Fibonacci number. This implies the sharp bound on the numbe ..."
Abstract
 Add to MetaCart
We show a new property of Fibonacci numbers which is related to the analysis of a very simple and natural parallel tree contraction algorithm. We show that the size of the smallest tree which requires t contractions equals exactly the tth Fibonacci number. This implies the sharp bound
Systematic Derivation of Tree Contraction Algorithms
 In Proceedings of INFOCOM '90
, 2005
"... While tree contraction algorithms play an important role in e#cient tree computation in parallel, it is di#cult to develop such algorithms due to the strict conditions imposed on contracting operators. In this paper, we propose a systematic method of deriving e#cient tree contraction algorithms f ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
While tree contraction algorithms play an important role in e#cient tree computation in parallel, it is di#cult to develop such algorithms due to the strict conditions imposed on contracting operators. In this paper, we propose a systematic method of deriving e#cient tree contraction algorithms
Optimal Tree Contraction and Term Matching on the . . .
, 1995
"... An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. ..."
Abstract
 Add to MetaCart
An optimal tree contraction algorithm for the boolean hypercube and the constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms
Parallel Tree Contraction  Part I: Fundamentals
, 1989
"... This paper introduces parallel tree contraction: a new bottomup technique for constructing parallel algorithms on trees. Contraction can be used to solve a wide variety of problems. Two examples included in this article are expression evaluation and subexpression elimination. In this paper we show ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper introduces parallel tree contraction: a new bottomup technique for constructing parallel algorithms on trees. Contraction can be used to solve a wide variety of problems. Two examples included in this article are expression evaluation and subexpression elimination. In this paper we show
Algorithms for Boolean Formula Evaluation and for Tree Contraction
 Arithmetic, Proof Theory and Computational Complexity
, 1991
"... This paper presents a new, simpler ALOGTIME algorithm for the Boolean sentence value problem (BSVP). Unlike prior work, this algorithm avoids the use of postfixlongeroperandfirst formulas. This paper also shows that treecontraction can be made ALOGTIME uniform. ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
This paper presents a new, simpler ALOGTIME algorithm for the Boolean sentence value problem (BSVP). Unlike prior work, this algorithm avoids the use of postfixlongeroperandfirst formulas. This paper also shows that treecontraction can be made ALOGTIME uniform.
Parallel Tree Contraction Part 2: Further Applications
 SIAM JOURNAL ON COMPUTING
, 1991
"... This paper applies the parallel tree contraction techniques developed in Miller and paper [Randomness and Computation, 5, S. Micali, ed., JAI Press, 1989, pp. 4772] to a number of fundamental graph problems. The paper presents an time and processor, a 0sided randomized algorithm for testing the i ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
This paper applies the parallel tree contraction techniques developed in Miller and paper [Randomness and Computation, 5, S. Micali, ed., JAI Press, 1989, pp. 4772] to a number of fundamental graph problems. The paper presents an time and processor, a 0sided randomized algorithm for testing
Dynamic Parallel Tree Contraction* (Extended Abstract)
"... Parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph algorithms. We propose a corresponding technique for the parallel solution of incremental problems. As our computational model, we assume a variant of the CRCW PRAM where ..."
Abstract
 Add to MetaCart
Parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph algorithms. We propose a corresponding technique for the parallel solution of incremental problems. As our computational model, we assume a variant of the CRCW PRAM
Results 1  10
of
661