Opportunistic algorithms for eliminating supersets (Q758205)

The main problem is that of finding each set in a given collection that has no proper subset in the collection. Starting with a solution that uses a quadratic (in the size of the collection) number of subset tests, solutions are developed that are opportunistic in the sense of running significantly faster for certain classes of input (such as when most sets are small), but without running slower on other input. They are based on an opportunistic algorithm for the fundamental problem of finding an element common to two ordered sequences. Methodological issues are emphasized throughout.