Skip to content

On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph

Pierre Kelsen

VenueA*STOC
Year1992
ProceedingsSTOC

Browse the full STOC paper archive.