Xref: utzoo sci.math:15849 comp.theory:1662
Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!usc!apple!agate!garnet.berkeley.edu!greg
From: greg@garnet.berkeley.edu (Greg Kuperberg)
Newsgroups: sci.math,comp.theory
Subject: How to implement the Solomon solution for graphs?
Message-ID: <1991Mar18.014319.5322@agate.berkeley.edu>
Date: 18 Mar 91 01:43:19 GMT
Sender: usenet@agate.berkeley.edu (USENET Administrator)
Reply-To: greg@math.berkeley.edu
Organization: U.C. Berkeley
Lines: 7

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