An efficient parallel algorithm that finds independent sets of guaranteed size

Authors:
Mark Goldberg;Thomas H. Spencer
Affiliations:
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 10
Cited 1

A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A random NC algorithm for depth first search

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
A new parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Constructing a maximal independent set in parallel

SIAM Journal on Discrete Mathematics
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
Parallel Prefix Computation

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

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Graph Theory With Applications

Graph Theory With Applications

Greed is good: approximating independent sets in sparse and bounded-degree graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract