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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 339-350

  Kelsen, Pierre ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MULTIPROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS; SET THEORY; THEOREM PROVING;

BINOMIAL DISTRIBUTION; DETERMINISTIC ALGORITHMS; HYPERGRAPH; MAXIMAL INDEPENDENT SET; PARALLEL COMPLEXITY; POLYNOMIAL NUMBER; RUNNING-IN; SUBLINEAR TIME;

GRAPH THEORY; COMPUTATIONAL METHODS;

BINOMIAL DISTRIBUTIONS; DERANDOMIZATION; HYPERGRAPHS; MAXIMAL INDEPENDENT SET; PARALLEL COMPLEXITY; PARALLEL RANDOM ACCESS MACHINES (PRAM); SUBLINEAR TIME DETERMINISTIC ALGORITHMS;

EID: 0026971186     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129745     Document Type: Conference Paper

References (16)

1. N. Alon, L. Babai, A. Itai, A fast randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7, pp. 567-583, 1986.
2. P. Bearne, Personal Communication, 1991.
3. P. Bearne, M. Luby, Parallel Search for Maximal Independence Given Minimal Dependence, Proceedings of the First SODA Conference, 1990, pp. 212218.
4. B. Berger, J. Rompel, Simulating (logc n)-wise Independence in NC, JACM, vol. 38, 1991, pp. 10261046.
5. E. Dahlhaus, M. Karpinski, An efficient algorithm for the 3MIS problem, Technical report TR-89-052, September 1989, International Computer Science Institute, Berkeley, CA.
6. E. Dahlhaus, M. Karpinski, P. Kelsen, An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3, Information Processing Letters, to appear.
7. M. Goldberg, T. Spencer, A new parallel algorithm for the maximal independent set problem, SIAM J. Computing, vol. 18, 1989, pp.419-427.
8. M. Goldberg, T. Spencer, Constructing a Maximal Independent Set in Parallel, SIAM J. Disc. Math., vol. 2, 1989, pp. 322-328.
9. R. Karp, V. Ramachandran, Parallel algorithms for shared memory machines, in Handbook of Theoretical Computer Science, J. Van Leeuwen, ed., North Holland, 1990, pp.869-941.
10. R. Karp, A. Wigderson, A fast parallel algorithm for the maximal independent set problem, JACM 32 (1985), pp. 762-773.
11. R. Karp, E. Upfal, A. Wigderson, The complexity of parallel search, JCSS, vol. 36, 1988, pp.225-253.
12. P. Kelsen, An efficient parallel algorithm for finding an mis in hypergraphs of dimension 3, manuscript, Department of Computer Sciences, University of Texas, Austin, TX, January 1990.
13. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Computing, vol. 15, 1986, pp. 1036-1053.
14. M. Luby, Removing randomness in parallel computation without a processor penalty, 29th FOCS, 1988, pp. 162-173.
15. R. Motwani, J. Naor, M. Naor, The probabilistic method yields deterministic parallel algorithms, 30th FOCS, 1989, pp. 8-13.
16. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, JCSS, vol. 37, 1988, pp. 130-143.