Parallel search for maximal independence given minimal dependence

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 212-218

  Beame, Paul ^a   Luby, Michael ^b,c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INDEPENDENCE SYSTEM; MAXIMAL INDEPENDENT SET; MINIMAL DEPENDENT SET; PARALLEL SEARCH;

ALGORITHMS;

EID: 0003496273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Alon, N., L. Babai, A. Itai, "A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem", Journal of Algorithms, 7, pp. 567-583, 1986.
2. Goldberg, M., T. Spencer, "A New Parallel Algorithm for the Maximal Independent Set Problem", preliminary version in proceedings of 28th Annual Symposium on Foundations of Computer Science, 1987, pp. 161-165, to appear in SI AM J. on Computing.
3. Karp, R. M., Upfal, E. and Wigderson, A., "The Complexity of Parallel Search?", JCSS, vol. 36, no. 2, April 1988, pp. 225-253.
4. Karp, R. M., A. Wigderson, A Fast Parallel Algorithm for the Maximal Independent Set Problem, Proc. 16th ACM Symposium on Theory of Computing, 1984, pp. 266-272.
5. Luby, M., "A Simple Parallel Algorithm for the Maximal Independent Set Problem", SIAM J. Comput, vol. 15, no. 4, November, 1986, pp. 1036-1053.
6. Luby, M., "Removing Randomness in Parallel Computation Without a Processor Penalty", preliminary version in proceedings of 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 162-173, to appear in special issue of JCSS.