Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,994,383 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Binary expression tree
Common subexpression elimination
Computer science
Euler tour technique
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
A Fast Parallel Tree Contraction for the Ray-object Calculus Using Open-MP
Z. Habbas
,
F. Herrmann
,
M. Krajecki
Computers and artificial intelligence
2001
Corpus ID: 33575328
Ray tracing is a well known algorithm in the visualization area for its image quality and its simplicity. Unfortunately, it is…
Expand
1995
1995
Efficient Parallel Algorithms for Planar DAGs
Stephen Guattery
,
G. Miller
1995
Corpus ID: 6186495
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…
Expand
1994
1994
1 Prior Work on sequential incremental tree algorithms
J. Reif
,
S. Tate
1994
Corpus ID: 7148836
Parallel tree contraction has been found to be a useful and quite powerful tool for the design of a wide class of efficient graph…
Expand
1987
1987
A Parallel Tree Contraction Algorithm
Karl R. Abrahamson
,
Norm Dadoun
,
D. Kirkpatrick
,
T. Przytycka
1987
Corpus ID: 118858675
A simple reduction from the tree contraction problem to the list ranking problem is presented. The reduction takes O$(\log n…
Expand