A simple parallel algorithm for the maximal independent set problem
M Luby - Proceedings of the seventeenth annual ACM …, 1985 - dl.acm.org
Simple parallel algorithms for the maximal independent set (MIS) problem are presented.
The first algorithm is a Monte Carlo algorithm with a very local property. The local property of …
The first algorithm is a Monte Carlo algorithm with a very local property. The local property of …
[PDF][PDF] A parallel algorithm for the maximal path problem
R Anderson - Proceedings of the seventeenth annual ACM …, 1985 - dl.acm.org
One of the* important arcas of rcsttiucli in pard-lcl WJllJlliLtiOl ia to idctltify problcnls that can
bc sped up significnntly using paA. lclism. The goals of thin work arc t, o find filrt p; &lcl …
bc sped up significnntly using paA. lclism. The goals of thin work arc t, o find filrt p; &lcl …
Fast parallel computation with permutation groups
EM Luks, P Mckenzie - 26th Annual Symposium on …, 1985 - ieeexplore.ieee.org
We develop fast parallel solutions to a number of basic problems involving solvable and
nilpotent permutation groups. Testing solvability is in NC, and RNC includes, for solvable …
nilpotent permutation groups. Testing solvability is in NC, and RNC includes, for solvable …