Search for all d-Mincuts of a limited-flow network
暂无分享,去创建一个
[1] Kailash C. Kapur,et al. Reliability Analysis for Multistate Systems with Multistate Components , 1983 .
[2] Richard E. Barlow,et al. Coherent Systems with Multi-State Components , 1978, Math. Oper. Res..
[3] David A. Butler,et al. Bounding the Reliability of Multistate Systems , 1982, Oper. Res..
[4] Robert E. Tarjan,et al. Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem , 2008 .
[5] Xue Janan,et al. On Multistate System Analysis , 1985, IEEE Transactions on Reliability.
[6] Wei-Chang Yeh. A simple approach to search for all d-MCs of a limited-flow network , 2001, Reliab. Eng. Syst. Saf..
[7] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[8] Noga Alon,et al. Generating Pseudo-Random Permutations and Maximum Flow Algorithms , 1990, Inf. Process. Lett..
[9] John Yuan,et al. Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .
[10] Shimon Even,et al. Graph Algorithms , 1979 .
[11] Terje Aven,et al. Reliability Evaluation of Multistate Systems with Multistate Components , 1985, IEEE Transactions on Reliability.
[12] S.H. Lee,et al. Reliability Evaluation of a Flow Network , 1980, IEEE Transactions on Reliability.
[13] Kurt Mehlhorn,et al. Can A Maximum Flow be Computed on o(nm) Time? , 1990, ICALP.
[14] K. K. Aggarwal,et al. A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..
[15] George S. Fishman,et al. A Monte Carlo Sampling Plan for Estimating Network Reliability , 1984, Oper. Res..
[16] Xue Janan,et al. New approach for multistate systems analysis , 1985 .
[17] E. Jamoulle,et al. Transportation networks with random arc capacities , 1972 .
[18] Kailash C. Kapur,et al. Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..
[19] Wei-Chang Yeh,et al. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network , 1998 .
[20] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[21] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[22] Chin-Chia Jane,et al. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.
[23] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[24] George S. Fishman. A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness , 1986, IEEE Transactions on Reliability.
[25] Terje Aven,et al. Some considerations on reliability theory and its applications , 1988 .
[26] Wei-Chang Yeh. Search for MC in modified networks , 2001, Comput. Oper. Res..
[27] Terje Aven,et al. Availability evaluation of oil/gas production and transportation systems , 1987 .