Path: utzoo!attcan!uunet!dino!ux1.cso.uiuc.edu!bach.crhc.uiuc.edu!mathew
From: mathew@bach.crhc.uiuc.edu (Ben Mathew)
Newsgroups: comp.theory
Subject: finding cutsets fast
Keywords: cutsets, graph theory, etc.
Message-ID: <1990Jul11.142212.6625@ux1.cso.uiuc.edu>
Date: 11 Jul 90 14:22:12 GMT
Sender: usenet@ux1.cso.uiuc.edu (News)
Reply-To: bm@uiuc.edu
Organization: University of Illinois at Urbana-Champaign
Lines: 7

Does anyone know of any references (books or papers) that
contain fast algorithms with a moderate storage
overhead that finds all cutsets of undirected cyclic
graphs?  I have a paper from the 1979 ISCAS, but it appears
to require a great deal of storage.  Thanks in advance.

Ben Mathew