To tackle those problems, Minimal Cut Sets (MCSs) can be computed in interaction graphs which are minimal sets of compounds or/and edges that have to be removed to interrupt a given set of paths and/or feedback loops [ 10].
Every optimization problem can be described in dual terms, and on this aspect, it is based on the concept of minimal cut set.
The planar multiway cut problem is a NP-hard generalization of the min-cut problem.
Under this definition, an extended network and its sink node have the same minimal cut sets.
The minimal cut sets (MSCs) of the fault trees are the hazards to be identified exactly.
To evaluate the system reliability, minimal cut sets for the extended network are defined for nodes.
One theoretical approach is based on Minimal Cut Sets (MCSs) which are minimal sets of knockouts disabling the operation of a specified set of target elementary modes.
A minimal cut set (MCS) has been defined as a minimal set of reactions whose removal blocks the operation of a chosen objective reaction.
One is the minimal cut contains a source point and a sink point.
This is because the number of disjoint routes is bounded to the (S, D) minimal cut.
