Definition
Schnitt
Cut
In graph theory, a cut is a partition of vertices of a graphs into two disjoint subsets
and . A cut that separates
is defined as:
Schnitt
Cut
In graph theory, a cut is a partition of vertices of a graphs into two disjoint subsets
and . A cut that separates
is defined as:
