Journal ArticleDOI
A simple parallel tree contraction algorithm
Reads0
Chats0
TLDR
In this paper, a simple reduction from the tree contraction problem to the list ranking problem is presented, which takes O(log n) time for a tree with n nodes, using O( n log n ) EREW processors Thus tree contraction can be done as efficiently as list ranking.About:
This article is published in Journal of Algorithms.The article was published on 1989-06-01. It has received 258 citations till now. The article focuses on the topics: K-ary tree & Segment tree.read more
Citations
More filters
Book ChapterDOI
Parallel algorithms for shared-memory machines
TL;DR: In this paper, the authors discuss parallel algorithms for shared-memory machines and discuss the theoretical foundations of parallel algorithms and parallel architectures, and present a theoretical analysis of the appropriate logical organization of a massively parallel computer.
Journal ArticleDOI
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
Paul B. Callahan,S. Rao Kosaraju +1 more
TL;DR: The notion of a well-separated pair decomposition of points in d-dimensional space is defined and the resulting decomposition is applied to the efficient computation of nearest neighbors and body potential fields.
Book
Limits to Parallel Computation: P-Completeness Theory
TL;DR: In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.
Journal ArticleDOI
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
TL;DR: Ambivalent data structures are presented for several problems on undirected graphs and used to dynamically maintain 2-edge-connectivity information and are extended to find the smallest spanning trees in an embedded planar graph in time.
Journal ArticleDOI
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
TL;DR: It is shown that efficient parallel split decomposition induces an efficient parallel parity graph recognition algorithm, a consequence of the result of S. Cicerone and D. Di Stefano that parity graphs are exactly those graphs that can be split decomposed into cliques and bipartite graphs.
References
More filters
Journal ArticleDOI
Complement reducible graphs
TL;DR: It is shown that this family of graphs can be uniquely represented by a tree where the leaves of the tree correspond to the vertices of the graph.
Journal ArticleDOI
The Parallel Evaluation of General Arithmetic Expressions
TL;DR: It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.
Journal ArticleDOI
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
TL;DR: It is pointed out that analyses of parallelism in computational problems have practical implications even when multi-processor machines are not available, and a unified framework for cases like this is presented.
Proceedings ArticleDOI
Parallel tree contraction and its application
Gary L. Miller,John H. Reif +1 more
TL;DR: A bottom-up algorithm to handle trees which has two major advantages over the top-down approach: the control structure is straight forward and easier to implement facilitating new algorithms using fewer processors and less time; and problems for which it was too difficult or too complicated to find polylog parallel algorithms are now easy.
Proceedings ArticleDOI
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
Richard Cole,Uzi Vishkin +1 more
TL;DR: A new deterministic coin tossing technique that provides for a fast and eff ient b reak ing of a symmetr ic s i tuat ion in paral le l is introduced.