Deterministic enumeration of all minimum cut-sets and $k$-cut-sets in hypergraphs for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of deterministically enumerating all minimum $k$-cut-sets in a given hypergraph for any fixed $k$. The input here is a hypergraph $G=(V,E)$ with non-nega…