Minimum Cuts in Surface Graphs

Erin W. Chambers, Jeff Erickson, Kyle Fox +1

We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $…