A revised layered-net work algorithm to search for all d-minpaths of a limited-flow acyclic network

IEEE Transactions on Reliability

Volumn 47, Issue 4, 1998, Pages 436-442

  Yeh, Wei Chang ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

D minpath; Layered network; Limited flow network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; RELIABILITY;

ACYCLIC NETWORKS; LIMITED-FLOW NETWORKS; REVISED LAYERED-NETWORK ALGORITHM (RLNA);

ELECTRIC NETWORK ANALYSIS;

EID: 0032273391     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.756087     Document Type: Article

References (23)

1. G.G. Jane, J.S. Lin, J. Yuan, "Reliability evaluation of a limited-flow network in terms of minimal cutsets", IEEE Trans. Reliability, vol 42, 1993 Sep, pp 354 - 361.
2. D.A. Butler, "Bounding the reliability of multistate systems" , Operations Research, vol 30, 1982, pp 530 - 544.
3. G.S. Fishman, "A comparison of four Monte Carlo methods for estimating the probability of s -t connectedness", IEEE Trans. Reliability, vol R-35, 1986 Jun, pp 145 - 155.
4. G.S. Fishman, "A Monte Carlo sampling plan for estimating network reliability", Operations Research, vol 31, 1986, pp 581 - 594.
5. J. Xue, "New approach for multistate systems analysis", Reliability Engineering, vol 10, 1985, pp 245 - 256.
6. J. Xue, "On multistate system analysis", IEEE Trans. Reliability, vol R-34, 1985 Oct, pp 329 - 337.
7. J. Yuan, C.C. Jane, J.S. Lin, "Study on two types of reliability modeling and their applications - II", NSC78-0415E007-05, 1989; Taiwan.
8. J.C. Hudson, K.C. Kapur, "Reliability analysis for multistate systems with multistate components", HE Trans, vol 15, 1983, pp 227- 135.
9. J.C. Hudson, K.C. Kapur, "Reliability bounds for multistate systems with multistate components", Operations Research, vol 33, 1985, pp 153 - 160.
10. J.S. Provan, M.O. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected", SIAM J. Computing, vol 12, num 4, 1983, pp 777 - 788.
11. L.G. Valiant, "The complexity of enumeration and reliability problems", SIAM J. Computing, vol 8, num 3, 1979, pp410 - 421.
12. M.R.. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-hardness, 1979; E.H. Freeman.
13. P. Doulliez, E. Jalnoulle, "Transportation network with random arc capacities". RAfRO, Re.r.h. Operations Research, vol 3, 1972, pp 45 - 60.
14. R.E. Barlow, A.S. Wu, "Coherent systems with multistate components", Math. Operations Research, vol 3, 1978, pp 275 - 281.
15. S.H. Lee, "Reliability evaluation of a flow network", IEEE Trans. Reliability, vol R-29, 1980 Apr, pp 21 - 26.
16. J.S. Lin, G.G. Jane, J. Yuan, "On reliability evaluation of a capacitated-flow network in terms of minimal pathsets", Networks, vol 25, 1995, pp 131 - 138.
17. T. Aven, "Availability evaluation of oil/gas production and transportation systems", Reliability Engineering, vol 18, 1987, pp35-44."
18. T. Aven, "Reliability evaluation of multistate systems with rnultistate components", IEEE Trans. Reliability, vol R-34, 1985 Dec, pp 473 - 479.
19. T. Aven, "Some considerations on reliability theory and its applications", Reliability Engineering and System Safety, vol 21, 1988, pp215- 223.
20. E.A. Dinic, "Algorithm for solution of a problem of maximum flow in a networks with power estimation", Soviet Mathematics Doklady, vol 11, 1970, pp 1277 - 1280.
21. K.K. Aggarwal. et al, "A simple method for reliability evaluation of a communication system", IEEE Tyrans. Communication, vol CONf-23, 1975, pp 563 - 565.
22. R..K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows - Theory, Algorithms, and Applications, 1993; PrenticeHall.
23. S. Even, Graph Algorithms, 1979; Computer Science Press.