A Parallel Randomized Algorithm for Find
โ
Tomasz ลuczak; Edyta Szymaลska
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 167 KB
We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.