Efficient Algorithms for Dualizing Large-Scale Hypergraphs

Keisuke Murakami, Takeaki Uno

A hypergraph $\mathcal{F}$ is a set family defined on vertex set $V$. The dual of $\mathcal{F}$ is the set of minimal subsets $H$ of $V$ such that $F\cap H\ne \varnothing$ for any $F\in {…