The present invention is a method of identifying all minimum-cost cutsets in a network to isolate two nodes S and T, by receiving a network that includes nodes and links; replacing each bidirectional link with two unidirectional links; assigning a cost to each node and link; choosing nodes S and T; removing any extraneous nodes and links that are not along a path from S to T; adding a node next to each original node; moving the links directed out of the original node to its added node; adding a link directed out of the original node and into its added node; assigning a cost to each added link that is equal to the cost of the corresponding original node; finding the paths from S to T that maximize the amount of flow from S to T, where flow capacity is equal to cost; generating a residual graph; finding each set of nodes in the residual graph that includes S, does not include T, and does not include a link directed from a node within the set to a node outside of the set; finding, for each closure, any links connected to the closure that are not members of the closure; choosing the minimum-cost cutset on which is most convenient to act; and eliminating the links and nodes as required by the minimum-cost cutset chosen in the last step to isolate S from T.Method of identifying all minimum-cost cutsets in a network659462415/07/200301/09/199920031,413Curet; Norman D.US Patent and Trademark OfficeGoogle Patent Searchpatentimages.storage.googleapis.com/US6594624B1/US06594624-20030715-D00000.pngUnique