Minimum vertex k-cut Posted by E. Lee, at cstheory.stackexchange.com, 06 Jun 2016 Given an undirected graph $G = (V, E)$ and an integer $k$, the well-known minimum (edge) $k$-cut problem asks to find $E' \subset…