Analysis of parallel algorithms for find
โ
H. Chen; A. M. Frieze
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 726 KB
It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study