A fast parallel algorithm for the maximal independent set problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 266-272

  Karp, Richard M ^a   Wigderson, Avi ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PARALLEL ALGORITHMS;

BALANCED INCOMPLETE BLOCK DESIGN; DETERMINISTIC SAMPLING; FAST PARALLEL ALGORITHMS; GRAPH G; MAXIMAL INDEPENDENT SET; PIGEONHOLE PRINCIPLE; RANDOM SAMPLING;

GRAPH THEORY;

EID: 85023372419     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808690     Document Type: Conference Paper

References (6)

1. Cook, S. A., "An Overview of Computational Complexity, " CACM 6, 400-408 (1983).
2. Cook, S. A., "The Classification of Problems which have Fast Parallel Algorithms, " Technical Report No. 164/83, Department of Computer Science, University of Toronto (1983).
3. Hall, M., Combinatorial Theory, Blaisdell (1907).
4. Jones, N. D., Lien, Y. E., Looser, W. T., "New Problems Complete for Nondeterministic Log Space, " Mathematical Systems Theory 10, 1-17 (1976).
5. Lev, G., "Size Bounds and Parallel Algorithms for Networks, " Report CST-8-80, Dept. of Computer Science, University of Edinburgh (1980).
6. Valiant, L. G., "Parallel Computation, " Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, (1982).