An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3

Elias Dahlhaus, Marek Karpinski, Pierre Kelsen. An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Inf. Process. Lett., 42(6):309-313, 1992.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.