Related references
Note: Only part of the references are listed.Improving efficiency of solving d-MC problem in stochastic-flow network
Zhou Yan et al.
RELIABILITY ENGINEERING & SYSTEM SAFETY (2007)
A simple algorithm to search for all MCs in networks
Wei-Chang Yeh
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts
YK Lin
RELIABILITY ENGINEERING & SYSTEM SAFETY (2006)
An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities
S Soh et al.
IEEE TRANSACTIONS ON RELIABILITY (2005)
A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes
WC Yeh
RELIABILITY ENGINEERING & SYSTEM SAFETY (2004)
Non-binary decomposition trees - a method of reliability computation for systems with known minimal paths/cuts
J Malinowski
RELIABILITY ENGINEERING & SYSTEM SAFETY (2004)
Minimal cut sets of s-t networks with k-out-of-n nodes
ZB Tan
RELIABILITY ENGINEERING & SYSTEM SAFETY (2003)
Search for all d-Mincuts of a limited-flow network
WC Yeh
COMPUTERS & OPERATIONS RESEARCH (2002)
A new approach to the d-MC problem
WC Yeh
RELIABILITY ENGINEERING & SYSTEM SAFETY (2002)
Search for minimal paths in modified networks
WC Yeh
RELIABILITY ENGINEERING & SYSTEM SAFETY (2002)
Search for MC in modified networks
WC Yeh
COMPUTERS & OPERATIONS RESEARCH (2001)
A simple approach to search for all d-MCs of a limited-flow network
WC Yeh
RELIABILITY ENGINEERING & SYSTEM SAFETY (2001)
Share Paper
