We consider the problem of finding the minimal(maximal) sets of a family of
sets that have no subset (superset) in the family. Given a family F of k sets with
N elements and a domain of size n, we propose two fast parallel algorithms for
solving this problem | an O(log N ) time algorithm using O(minf kN
log N ; k2n
log2 N )
processors on a CREW PRAM and a constant-time algorithm using O(nN +
minfkN; k2n
log N g) processors on a combining CRCW, both analyzed in the worst