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.
@article{DahlhausKK92,
title = {An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3},
author = {Elias Dahlhaus and Marek Karpinski and Pierre Kelsen},
year = {1992},
researchr = {https://researchr.org/publication/DahlhausKK92},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {42},
number = {6},
pages = {309-313},
}