An NC algorithm for finding a maximal acyclic set in a graph

Authors:
Aaron Windsor
Affiliations:
University of Georgia, Athens, GA
Venue:
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2004

Citing 14
Cited 0

Data structures and network algorithms

Data structures and network algorithms
A fast parallel algorithm for the maximal independent set problem

Journal of the ACM (JACM)
A new parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Efficient sequential and parallel algorithms for maximal bipartite sets

Journal of Algorithms
Minimum spanning hypertrees

Discrete Applied Mathematics
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
Fast Connected Components Algorithms for the EREW PRAM

SIAM Journal on Computing
A better approximation algorithm for finding planar subgraphs

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Concurrent threads and optimal parallel minimum spanning trees algorithm

Journal of the ACM (JACM)
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

SIAM Journal on Computing
Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

Information Processing Letters
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

An acyclic set in an undirected graph G = (V,E) is a set A ⊆ V(G) such that the induced graph on A is acyclic. A maximal acyclic set (MAS) has the further property that no vertex can be added to it without creating a cycle in the induced graph. We present the first NC algorithm that finds an MAS in any graph, running in time O(log4 n) using O((m2 + n)/log n) processors on a EREW PRAM, answering questions raised by Chen and He. Our NC algorithm for finding an MAS in a graph relies on a novel NC algorithm for finding a maximal forest in a hypergraph which may be of independent interest.