A simple hypergraph min cut algorithm

Abstract

We present an algorithm for finding the minimum cut of an edge-weighted hypergraph. It is simple in every respect. It has a short and compact description, is easy to implement and has a surprisingly simple proof of correctness. The runtime is O(jV j 2 log jV j+jV j \\Delta jjEjj) where jjEjj is the sum of the cardinalities of the hyperedges.