greg@garnet.berkeley.edu (Greg Kuperberg) (03/18/91)
Consider a connected planar graph with 2*n nodes, which for simplicity can be assumed to be tetravalent. Is there a fast/good/clever algorithm to find the smallest cut set that divides the graph into two subgraphs with n nodes? ---- Greg Kuperberg greg@math.berkeley.edu