A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity

Oscar Garrido, Pierre Kelsen, Andrzej Lingas. A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. Inf. Process. Lett., 58(2):55-58, 1996. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.