RESIN, A Desktop-Computer Program for Finding Cut-Sets

This paper describes an efficient algorithm for finding the minimal cut-sets for the output nodes of any network. The advantages over previously published algorithms are that it can be used on a desktop computer, and it requires simpler input data preparation hence providing for rapid testing of the effect of network changes.