New algorithm in enumerating all minimal paths in a sparse network

Reliability Engineering and System Safety

Volumn 65, Issue 1, 1999, Pages 11-15

  Kobayashi, K ^a   Yamamoto, H ^b  

^a Res Institute of Systems Planning   (Japan)

^b Fac Eng Tokyo Metropol Inst T   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS;

DEPTH-FIRST-SEARCH (DFS) ALGORITHMS; MINIMAL PATHS;

SYSTEMS ENGINEERING;

EID: 0032647860     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0951-8320(98)00076-3     Document Type: Article

References (5)

1. Abraham JA. An improved algorithm for network reliability. IEEE Trans Reliab 1979; R28(1) April.
2. Aggarwal KK. Integration of reliability and capacity in performance measure of a telecommunication Network IEEE Trans Reliab 1985;R34(2) June.
3. Arunkumar S, Lee SH. Enumeration of all minimal cut-sets for a node pair in a graph. IEEE Trans Reliab 1979;R28(1) April.
4. Shier DR. Network reliability and algebraic structures. Oxford Science, 1991.
5. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Reliab 1995;35(6).