olemus
graafi tippude hulga tükeldus kaheks lõikumatuks alamhulgaks
=
a partition of the vertices of a graph into two disjoint subsets

näide
http://tracer.lcc.uma.es/problems/maxcut/maxcut1.gif

ülevaateid
https://en.wikipedia.org/wiki/Cut_(graph_theory)

https://en.wikipedia.org/wiki/Graph_cut_optimization

http://www.cs.ucf.edu/courses/cap6411/cap6411/spring2006/Lecture11.pdf