A hypergraph F is a set family defined on vertex set V . The dual of F is the set of minimal subsetsH of V such that F∩H 6= ∅ for any F ∈ F . The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving ...
