A simple algorithm to search for all MCs in networks

European Journal of Operational Research

Volumn 174, Issue 3, 2006, Pages 1694-1705

  Yeh, Wei Chang ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Minimal cuts (MC); Network reliability

Indexed keywords

CONTROL SYSTEMS; NETWORKS (CIRCUITS); PLANNING; PRODUCT DESIGN; RELIABILITY; THEOREM PROVING;

MINIMAL CUTS (MC); NETWORK RELIABILITY;

ALGORITHMS;

EID: 33746855565     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.047     Document Type: Article

References (35)

1. Roberts F.S., Hwang F.K., and Monma C. Reliability of computer and communication networks. DIMACS series in discrete mathematics and theoretical computer science vol. 5 (1991), AMS/ACM publisher
2. Ke W.J., and Wang S.D. Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Transactions on Reliability 46 (1997) 342-349
3. Aven T. Availability evaluation of oil/gas production and transportation systems. Reliability Engineering 18 (1987) 35-44
4. Aven T. Some considerations on reliability theory and its applications. Reliability Engineering and System Safety 21 (1988) 215-223
5. Malinowski J., and Preuss W. Reliability evaluation for tree-structured systems with multistate components. Microelectronics Reliability 36 (1996) 9-17
6. Yeh W.C. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability 47 (1998) 436-442
7. Yeh W.C. A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering & System Safety 71 (2001) 15-19
8. Yeh W.C. A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering & System Safety 73 1 (2001) 49-54
9. Yeh W.C. Search for MC in modified networks. Computers & Operations Research 28 (2001) 177-184
10. Yeh W.C. Search for all d-mincuts of a limited-flow network. Computers & Operations Research 29 13 (2002) 1843-1858
11. Yeh W.C. Search for minimal paths in modified networks. Reliability Engineering & System Safety 75 3 (2002) 389-395
12. Yeh W.C. A simple method to verify all d-minimal path candidates of a limited-flow network and its reliability. International Journal of Advanced Manufacturing Technology 20 1 (2002) 77-81
13. Yeh W.C. A MCS-RSM approach for the network reliability to minimize the total cost. International Journal of Advanced Manufacturing Technology 22 9-10 (2003) 681-688
14. Yeh W.C. Search for all MCs in networks with unreliable nodes and arcs. Reliability Engineering & System Safety 79 1 (2003) 95-101
15. Yeh W.C. Multistate-Node Acyclic Network Reliability Evaluation. Reliability Engineering & System Safety 78 2 (2002) 123-129
16. Colbourn C.J. The combinatorics of network reliability (1987), Oxford University Press, New York
17. Allan R.N., Rondiris I.L., and Fryer D.M. An efficient computational technique for evaluating the cut/tie and common cause failures of complex systems. IEEE Transactions on Reliability R-30 (1981) 101-109
18. Nahman J.M. MPs and cuts or networks exposed to common-cause failures. IEEE Transactions on Reliability R-41 (1992) 76-80 84
19. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics Reliability 35 6 (1995) 973-976
20. Jasmon G.B., and Foong K.W. A method for evaluating all the minimal cuts of a graph. IEEE Transactions on Reliability R-36 (1987) 538-545
21. Bellmore M., and Jensen P.A. An implicit enumeration scheme for proper cut generation. Technometrics 12 4 (1970) 775-788
22. Martelli H. A Gaussian elimination algorithm for enumeration of cutsets in a graph. Journal of ACM 23 (1976) 58-73
23. Biegel J.K. Determination of tie sets and cut sets for a system without feedback. IEEE Transactions on Reliability R-26 (1977) 39-41
24. Locks M.O. Inverting and minimalizing pathsets and cutsets. IEEE Transactions on Reliability R-27 (1978) 107-109
25. Rai S. Comments on: Inverting and minimalizing path sets and cut sets. IEEE Transactions on Reliability R-32 (1979) 263
26. Arumkumar S., and Lee S.H. Enumeration of all minimal cutsets for a node pair in a graph. IEEE Transactions on Reliability R-28 (1979) 51-55
27. Rai S., and Aggarwal K.K. On complementation of pathsets and cutsets. IEEE Transactions on Reliability R-29 (1980) 139-140
28. Abel U., and Bicker R. Determination of all minimal cut-sets between a vertex pair in an undirected graph. IEEE Transactions on Reliability R-31 (1982) 167-171
29. Heidtmann K.D. Inverting paths and cuts of 2-state systems. IEEE Transactions on Reliability R-32 (1983) 469-471
30. Shier D.R., and Whiled D.E. Algorithms for generating minimal cutsets by inversion. IEEE Transactions on Reliability R-34 (1985) 314-319
31. Jasmon G.B., and Kai O.S. A new technique in minimal path and cutest evaluation. IEEE Transactions on Reliability R-34 (1985) 136-141
32. Jasmon G.B. Cutset analysis of networks using basic minimal paths and network decomposition. IEEE Transactions on Reliability 34 (1985) 303-307
33. Samad M.A. An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network. Microelectronics Reliability 27 3 (1987) 437-441
34. Ahmad S.H. Simple enumeration of minimal cutsets of acyclic directed graph. IEEE Transactions on Reliability R-37 (1988) 484-487
35. Elias S.S., Mokhles N., and Ibrahim S.A.N. A new technique in a cut set evaluation. Microelectronics Reliability 33 9 (1993) 1351-1355