✦ LIBER ✦

Reliability and flow graphs

✍ Scribed by L. Råde

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 278 KB
Volume: 14
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(75)90156-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Signal-flow graphs in reliability theory

✍ Shunji Osaki 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Reliability evaluation of communication

Reliability evaluation of communication systems using flow graphs

✍ K.K.A. Aggarwal; J.S. Gupta; K.B. Misra 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Reliability and flow graphs : L. Rade. M

Reliability and flow graphs : L. Rade. Microelectron. and Reliab.14, 447 (1975)

📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Empirical formulas and global reliabilit

Empirical formulas and global reliability evaluation of reliability graphs

✍ M.A. Aziz; M.A. Sobhan; M.A. Samad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Uniformly least reliable graphs

✍ Petingi, L.; Saccoman, J. T.; Schoppmann, L. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

The all-terminal reliability (ATR) of an undirected graph G , denoted as R(G , q ) , is the probability that, when the edges are assigned independent but equal failure probabilities q, 0 < q < 1 (nodes are perfect), the surviving edges induce a spanning connected subgraph of G . A graph G with n nod

Uniformly optimally reliable graphs

✍ Gross, D.; Saccoman, J. T. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

A graph with n nodes and e edges, where the nodes are perfectly reliable and the edges fail independently with equal probability r, is said to be uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the same number of nodes and edges for all values of r. UOR si