Yellin and Jutla [2] proposed an algorithm for the problem of finding the
extremal sets in a family of sets containing N elements that can be implemented
in O( N2
log N ) time and O( N2
log N ) space due to Pritchard [1] who also showed that