Check the estimated amount of work for each cut with the same number of vertices and select the one with the minimum expected work.
Eventually, this could be done recursively, but for a start we can use just the product of the number of coarse options for each group (the two splits and the cut set).
Check the estimated amount of work for each cut with the same number of vertices and select the one with the minimum expected work.
Eventually, this could be done recursively, but for a start we can use just the product of the number of coarse options for each group (the two splits and the cut set).