Node-pair reliability of network systems with small distances between adjacent nodes

Reliability Engineering and System Safety

Volumn 92, Issue 4, 2007, Pages 479-489

  Malinowski, Jacek ^a  

^a WARSAW SCHOOL OF INFORMATION TECHNOLOGY   (Poland)

Author keywords

Directed undirected graph; K terminal reliability; Network reliability; Random graph; Sequence ordering; Sliding window technique; Two terminal reliability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; RELIABILITY THEORY;

DIRECTED GRAPHS; K-TERMINAL RELIABILITY; NETWORK RELIABILITY; RANDOM GRAPHS; SEQUENCE ORDERING; SLIDING WINDOW TECHNIQUES; TWO-TERMINAL RELIABILITY; UNDIRECTED GRAPHS;

SYSTEMS SCIENCE;

EID: 33845625119     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ress.2005.12.012     Document Type: Article

References (6)

1. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completness (1979), Freeman, San Francisco
2. Ball M.O. Computational complexity of network reliability analysis. IEEE Trans Reliab R-35 (1986) 230
3. Kuo S.Y. Determining terminal-pair reliability based on Edge Expansion Diagrams using OBDD. IEEE Trans Reliab 48 3 (1999) 234
4. Ramirez-Marquez J.E., and Coit D.W. A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability. Reliab Eng Syst Saf 87 2 (2005) 141
5. Lin M.S. A linear-time algorithm for computing K-terminal reliability on Proper Interval Graphs. IEEE Trans Reliab 51 1 (2002) 58
6. Barlow RE, Proschan F. Mathematical theory of reliability. Philadelphia, PA: SIAM; 1996.