ID NAME QUALITY USERS ACC % DIFFICULTY C I
33022 Ada and Hose   6
1693 Coconuts   8 608
22
29
34409 Disconnected country   9
9577 Dynamic Tree Connectivity   8 249
34
26
4485 MobiZone vs VinaGone   4 249
21
34

#min-cut

A cut is a partition of vertices of a graph into two subsets disjoint subsets. Minimum cut is a cut with a smallest possible cut-set.

https://en.wikipedia.org/wiki/Minimum_cut http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf