Determination of minimal upper paths for reliability analysis of planar flow networks

Reliability Engineering and System Safety

Volumn 39, Issue 1, 1993, Pages 1-10

  Lee, Dong Wha ^a   Yum, Bong Jin ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PERFORMANCE; PROBABILITY; TREES (MATHEMATICS);

ENUMERATION TREES; MINIMAL UPPER PATHS; PLANAR FLOW PATHS; STOCHASTIC FLOW NETWORKS; SUBNETWORKS;

RELIABILITY;

EID: 0027148095     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/0951-8320(93)90143-M     Document Type: Article

References (12)

1. Transportation networks with random arc capacities
2. Reliability evaluation of a flow network
3. Capacity consideration in reliability analysis of communication systems
4. Reliability analysis of networks with capacity-constraints and failures at branch and nodes
5. Enumeration of all simple paths in a communication network
6. A new technique in minimal path and cutset evaluation
7. An improved algorithm for network reliability
8. Recursive disjoint products A review of three algorithms
9. Reliability evaluation of multistate systems with multistate components
10. Two new component importance measures for a flow network system