Skip to search formSkip to main contentSkip to account menu

Parallel Tree Contraction

In computer science, parallel tree contraction is a broadly applicable technique for the parallel solution of a large number of tree problems, and is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Binary expression treeCommon subexpression eliminationComputer scienceEuler tour technique

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Ray Specialized Contraction on Bounding Volume Hierarchies
In this paper we propose a simple but effective method to modify a BVH based on ray distribution for improved ray tracing… 
2009
2009
Solving Hypertree Structured CSP: Sequential and Parallel Approaches
Solving CSP is in general NP-Complete. However, there are various subsets of CSPs that can be solved in polynomial time. Some of… 
2001
2001
A Fast Parallel Tree Contraction for the Ray-object Calculus Using Open-MP
Ray tracing is a well known algorithm in the visualization area for its image quality and its simplicity. Unfortunately, it is… 
2000
2000
A no-busy-wait balanced tree parallel algorithmic paradigm
Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy… 
1995
1995
Efficient Parallel Algorithms for Planar DAGs
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log* n) time (O(log n) time using… 
1994
1994
1 Prior Work on sequential incremental tree algorithms
Parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph… 
1987
1987
A Parallel Tree Contraction Algorithm
A simple reduction from the tree contraction problem to the list ranking problem is presented. The reduction takes O$(\log n… 
1987
1987
Parallel Algorithms for Message Decomposition
  • S. TengBin Wang
  • J. Parallel Distributed Comput.
  • 1987
  • Corpus ID: 8512126
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)