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]

Authors

Oscar Garrido

This author has not been identified. Look up 'Oscar Garrido' in Google

Pierre Kelsen

This author has not been identified. Look up 'Pierre Kelsen' in Google

Andrzej Lingas

This author has not been identified. Look up 'Andrzej Lingas' in Google