Parallel search for maximal independence given minimal dependence

Authors:
Paul Beame;Michael Luby
Affiliations:
Computer Science Department, University of Washington, Seattle, Washington;International Computer Science Institute, Suite 600, 1947 Center Street, Berkeley, California
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

On the parallel complexity of computing a maximal independent set in a hypergraph

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finding large independent sets of hypergraphs in parallel

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A fast localized algorithm for scheduling sensors

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
A global parallel algorithm for the hypergraph transversal problem

Information Processing Letters
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Theoretical Computer Science
A new algorithm for the hypergraph transversal problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Hi-index	0.00