M. Forghani-elahabad

Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

[ 1 ] - On Search for all d-MCs in a Network Flow

A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...

Co-Authors