Abstract: This study provides a detailed review on the generation of the Minimal Cutsets and Minimal Pathsets between any single pair of terminals and for multi-terminal pairs for s-t network. A comparative study is made between the first technique, which deals with the generation of Minimal Cutsets by the node removal method over the given s-t network versus the second technique, which deals with the generation of Minimal Cutsets from Minimal Pathsets by the application of Inter-conversion over minimization technique for a given s-t network. The study concludes that the second technique is comparatively more advantageous, because in the calculation of network reliability, both the Minimal Pathsets and Minimal Cutsets play a vital role. The first technique generates only Minimal Cutsets and the generation of Minimal Pathsets should be done separately. But this is not so in the case of second technique, as it uses the Inter-conversion and minimization technique to convert Minimal Pathsets to Minimal cutsets for a given s-t network. Since this technique is applied over the generation of minimal pathsets for a given s-t networks based on the decomposition of the given network. Decomposition is performed, so that if 2 or more sub-networks are homogeneous, calculation of Minimal Pathsets, for each sub-network are not required. Thus the time required to generate Minimal Pathsets and from it Minimal Cutsets for the network is reduced. Thus the second technique is more efficient for large and complex networks.