An efficient methodology to solve the K-terminal network reliability problem

Abstract

An efficient way of solving the K-terminal network reliability measure of a directed/undirected graphs using the method of ROBDD have been presented. In this paper, the breadth first search traversal order to enumerate the minimal paths and sum of disjoint products approach has been used to solve the probability calculation for K-vertices of the given network.