Parallelism and greedy algorithms

Authors:
Richard Anderson;Ernst Mayr
Affiliations:
-;-
Venue:
Parallelism and greedy algorithms
Year:
1984

Citing 0
Cited 4

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

IEEE Transactions on Computers
A parallel algorithm for the maximal path problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A random NC algorithm for depth first search

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On Parallel Partial Solutions and Approximation Schemesfor Local Consistency in Networks of Constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of greedy algorithms are examined and are shown to be probably inherently sequential. Greedy algorithms are presented for finding a maximal path, for finding a maximal set of disjoint paths in a layered dag, and for finding the largest induced subgraph of a graph that has all vertices of degree at least k. It is shown that for all of these algorithms, the problem of determining if a given node is in the solution set of the algorithm is P-complete. This means that it is unlikely that these sequential algorithms can be sped up significantly using parallelism.