Results 1 
6 of
6
Efficient Parallel Algorithms for Tree Accumulations
 Science of Computer Programming
, 1994
"... Accumulations are higherorder operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
Accumulations are higherorder operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree algorithms. We present two Erew Pram algorithms for computing accumulations on trees taking O(log n) time on O(n= log n) processors, which is optimal.
RealTime Minimum Vertex Cover For TwoTerminal SeriesParallel Graphs
 Proceedings of the Thirteenth Conference on Parallel and Distributed Computing and Systems
, 2000
"... Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively definable graphs. The method is based on processing the parse tree associated with a member of such a family of graphs in a bottomup fashion, such that the solution to the problem is ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively definable graphs. The method is based on processing the parse tree associated with a member of such a family of graphs in a bottomup fashion, such that the solution to the problem is obtained at the root of the tree. Sequentially, this can be done in linear time with respect to the size of the input graph. In parallel, efficient and even cost optimal tree contraction algorithms have also been developed. In this paper we show how the method can be applied to compute the cardinality of the minimum vertex cover of a twoterminal seriesparallel graph. We then construct a realtime paradigm for this problem and show that in the new computational environment, a parallel algorithm is superior to the best possible sequential algorithm, in terms of the accuracy of the solution computed. Specifically, there are cases in which the solution produced by a parallel algorithm ...
An Optimal Parallel Matching Algorithm for Cographs
 Journal of Parallel and Distributed Computing
, 1994
"... The class of cographs, or complementreducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$ver ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The class of cographs, or complementreducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in $G$ in O($logn$) time using O($n0$) processors in the EREWPRAM model. Key Words: list ranking, tree contraction, matching, parenthesis matching, scheduling, operating systems, cographs, parallel algorithms, EREWPRAM. 1. Introduction A wellknown class of graphs arising in a wide spectrum of practical applications [1,2,7] is the class of cographs, or complementreducible graphs. The cographs are defined recursively as follows: . a singlevertex graph is a cograph; . if $G$ is a cograph, then its complement $G bar$ is also a cograph; . if $G$ and $H$ are cographs, then their union is also a cog...
Efficient Implementation of Tree Skeletons on DistributedMemory Parallel Computers
, 2006
"... The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electron ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each authorâ€™s copyright. These works may not be reposted without the explicit permission of the copyright holder.
Optimal Tree Ranking is in NC
"... This paper places the optimal tree ranking problem in NC. A ranking is a labeling of the nodes with natural numbers such that if nodes u and v have the same label then there exists another node with a greater label on the path between them. An optimal ranking is a ranking in which the largest label ..."
Abstract
 Add to MetaCart
This paper places the optimal tree ranking problem in NC. A ranking is a labeling of the nodes with natural numbers such that if nodes u and v have the same label then there exists another node with a greater label on the path between them. An optimal ranking is a ranking in which the largest label assigned to any node is as small as possible among all rankings. An O(n) sequential algorithm is known. Researchers have speculated that this problem is P complete. We show that for an nnode tree, one can compute an optimal ranking in O(log n) time using n 2 = log n CREW PRAM processors. In fact, our ranking is super critical in that the label assigned to each node is absolutely as small as possible. We achieve these results by showing that a more general problem, which we call the super critical numbering problem, is in NC. No NC algorithm for the super critical tree ranking problem, approximate or otherwise, was previously known; the only known NC algorithm for optimal tree ranking ...
rDomination problems on trees and their homogeneous extensions
, 1995
"... . A graph is a homogeneous extension of a tree iff the reduction of all homogeneous sets (sometimes called modules) to single vertices gives a tree. We show that these graphs can be recognized in linear sequential and polylogarithmic parallel time using modular decomposition. As an application of so ..."
Abstract
 Add to MetaCart
. A graph is a homogeneous extension of a tree iff the reduction of all homogeneous sets (sometimes called modules) to single vertices gives a tree. We show that these graphs can be recognized in linear sequential and polylogarithmic parallel time using modular decomposition. As an application of some results on homogeneous sets we present a linear time algorithm computing the vertex sets of the connected components of the complement of an arbitrary graph. Moreover we present efficient parallel algorithms solving the problems rdominating set, r dominating clique and connected rdominating set (and thus the Steiner tree problem) on trees by reducing these problems to algebraic tree computations. Using these algorithms we can compute minimum rdominating cliques and minimum connected rdominating sets in homogeneous extensions of trees in linear sequential and logarithmic parallel time using a linear number of processors. Finally, we give a more involved sequential algorithm solv...