scholarly journals Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree

2014 ◽  
Vol 7 (0) ◽  
pp. 148-156
Author(s):  
Akimasa Morihata ◽  
Kiminori Matsuzaki
Keyword(s):  
Tree Contraction

Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks

Algorithmica ◽  
1997 ◽  
Vol 18 (3) ◽  
pp. 445-460 ◽  
Author(s):  
E. W. Mayr ◽  
R. Werchner
Keyword(s):  
Tree Contraction ◽  
Optimal Tree

Exact analysis of three tree contraction algorithms

1991 ◽  
pp. 370-379
Author(s):  
Wojciech Plandowski ◽  
Wojciech Rytter ◽  
Tomasz Szymacha
Keyword(s):  
Exact Analysis ◽  
Tree Contraction

SYSTEMATIC DERIVATION OF TREE CONTRACTION ALGORITHMS

2005 ◽  
Vol 15 (03) ◽  
pp. 321-336 ◽  
Author(s):  
KIMINORI MATSUZAKI ◽  
ZHENJIANG HU ◽  
KAZUHIKO KAKEHI ◽  
MASATO TAKEICHI
Keyword(s):  
Parallel Algorithm ◽  
Systematic Method ◽  
Recursive Functions ◽  
Connected Set ◽  
Tree Contraction ◽  
Systematic Derivation

While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on contracting operators. In this paper, we propose a systematic method of deriving efficient tree contraction algorithms from recursive functions on trees. We identify a general recursive form that can be parallelized into efficient tree contraction algorithms, and present a derivation strategy for transforming general recursive functions to the parallelizable form. We illustrate our approach by deriving a novel parallel algorithm for the maximum connected-set sum problem on arbitrary trees, the tree-version of the well-known maximum segment sum problem.

COMPUTATION LIST EVALUATION AND ITS APPLICATIONS

1992 ◽  
Vol 02 (04) ◽  
pp. 321-329 ◽  
Author(s):  
ELIEZER A. ALBACEA
Keyword(s):  
Simple Algorithm ◽  
List Ranking ◽  
Tree Contraction ◽  
Euler Tour ◽  
Problem Instances

In this paper, we present an algorithm for a generalization of list ranking called computation list evaluation. As a consequence of the generalization and the existence of this algorithm for computation list evaluation, we obtain a generalization of Euler Tour technique. Finally, we present several applications of the generalized Euler Tour technique. Of interest in the applications is the identification of a set of problem instances that are solvable using tree contraction and which can alternatively be solved using a simple algorithm based on the generalized Euler Tour technique.

scholarly journals Optimal Tree Contraction in the EREW Model

1988 ◽  
pp. 139-156 ◽  
Author(s):  
Hillel Gazit ◽  
Gary L. Miller ◽  
Shang-Hua Teng
Keyword(s):  
Tree Contraction ◽  
Optimal Tree

Parallel tree-contraction and Fibonacci numbers

1996 ◽  
Vol 59 (5) ◽  
pp. 267-271 ◽  
Author(s):  
Wojciech Plandowski ◽  
Wojciech Rytter ◽  
Tomasz Szymacha
Keyword(s):  
Fibonacci Numbers ◽  
Tree Contraction
Sign in / Sign up

Export Citation Format

Share Document