Parallel algorithms for maximal acyclic sets

Authors:
Zhi-Zhong Chen;Xin He
Affiliations:
-;-
Venue:
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Year:
1995

Citing 4
Cited 0

A fast parallel algorithm for the maximal independent set problem

Journal of the ACM (JACM)
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
A simple parallel algorithm for computing the diameters of all vertices in a tree and its application

Information Processing Letters
Efficient sequential and parallel algorithms for maximal bipartite sets

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph G=(V, E), the classical spanning forest problem of G can be viewed as the problem of finding a maximal subset F of E inducing an acyclic subgraph. Although it is well known that this problem has efficient NC algorithms, its vertex counterpart, i.e., the problem of finding a maximal subset U of V inducing an acyclic subgraph, has not been shown to be in NC (or even in RNC) and is not believed to be parallelizable in general. We present NC algorithms for solving the latter problem for three special cases. The first algorithm solves the problem for planar graphs in O(log/sup 3/ n) time using O(n) processors on an EREW PRAM. The second algorithm solves the problem for K/sub 3,3/-free graphs in O(log/sup 4/ n) time using O(n) processors on an EREW PRAM. The third algorithm solves the problem for graphs without long induced paths in poly-logarithmic time using O(n/sup 2376/) processors on an EREW PRAM.