A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set

Colloque avec actes et comité de lecture. internationale.International audienceThe ``Lexicographically First Maximal Independent Set Problem'' on graphs with bounded degree 3 is at most sqrt(n)-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p \in O(\log n)