mathew@bach.crhc.uiuc.edu (Ben Mathew) (07/11/90)
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