Simple method to extract minimal cut sets of a direct network

Abstract

System planning, design, and control, network reliability validation, and evaluation are critical. The enumeration of minimal cut sets (MCs) in a network is usually more complicated than the search for minimal path sets (MPs). The purpose of this research is to offer an efficient accurate approach for enumerating directed networks’ MCs. The method is concerned with determining the MCs depending on the set of minimal path nodes.