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]
@article{GarridoKL96,
title = {A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity},
author = {Oscar Garrido and Pierre Kelsen and Andrzej Lingas},
year = {1996},
doi = {10.1016/0020-0190(96)00040-3},
url = {http://dx.doi.org/10.1016/0020-0190(96)00040-3},
researchr = {https://researchr.org/publication/GarridoKL96},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {58},
number = {2},
pages = {55-58},
}