A 1989 paper by Jerrum and Sinclair reduces a problem about finding these things to ferromagnetic instances of the Ising model to show that finding the partition function of the latter is #P-complete. (-5[1])A poly-time approximation ratio (15[1])of 0.878 achieved by the Goemans-Williamson algorithm for a problem about these things is optimal (15[1])only if the unique game conjecture holds. The size of one type of these things is equal to the total number of disjoint paths by Menger’s (-5[1])theorem. The (-5[1])Stoer-Wagner algorithm (-5[1])finds one of these things (-5[1])for (*) undirected (10[1])graphs recursively, while Karger’s algorithm (-5[1])computes it probabilistically. (-5[1])The “minimum” (-5[2])one of these things (-5[1])can be produced from the (10[1])Ford-Fulkerson (-5[2])algorithm (-5[1])via (10[1])a namesake theorem (10[1])that relates it to the maximum (10[2])flow. (10[1]-5[1])For 10 points, name (10[1])these partitions of a graph (10[1])into two disjoint subsets of (10[1])vertices. ■END■ (10[2]0[5])