Cut (graph)
maths
Cut
Let $G = (V,E)$ be a undirected graph. A cut of $G$ is a partition of $V = S \cup \overline{S}$. The cut edges are
$$cut(S,\overline{S}) = \{(v,w) \in E \vert v \in S, w \in \overline{S}\}.$$Let $G = (V,E)$ be a undirected graph. A cut of $G$ is a partition of $V = S \cup \overline{S}$. The cut edges are
$$cut(S,\overline{S}) = \{(v,w) \in E \vert v \in S, w \in \overline{S}\}.$$