Enumeration of minimal cuts of modified networks

Microelectronics Reliability

Volumn 37, Issue 3, 1997, Pages 483-485

  Nahman, J M ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; GRAPH THEORY; RELIABILITY; RELIABILITY THEORY;

MINIMAL CUTS; MODIFIED NETWORK; RELIABILITY ANALYSIS;

ELECTRIC NETWORK ANALYSIS;

EID: 0031103023     PISSN: 00262714     EISSN: None     Source Type: Journal    
DOI: 10.1016/0026-2714(95)00215-4     Document Type: Article

References (5)

1. Allan, R. N., Billinton, R., and De Oliveira, M. F., An efficient algorithm for deducing the minimal cuts and reliability indices of a general network configuration. IEEE Trans. Reliab., 1976, R-25, 226-233.
2. Allan, R. N., Rondiris, I. L., and Fryer, D. M., An efficient computational technique for evaluating the cut/tie sets and common cause failures of complex systems. IEEE Trans. Reliab., 1981, R-30, 101-109.
3. Samad, M. A., An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network. Microelectron. Reliab., 1987, 27, 437-441.
4. Nahman, J. M., Enumeration of minimal paths of modified networks, Microelectron. Reliab., 1994, 34, 475-484.
5. Nahman, J. M., Minimal paths and cuts of networks exposed to common-cause failures. IEEE Trans. Reliab., 1982, R-41, 76-80, 84.