✦ LIBER ✦

Complexity of network reliability computations

✍ Scribed by Michael O. Ball

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 614 KB
Volume: 10
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230100206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact calculation of computer network re

Exact calculation of computer network reliability

✍ E. Hänsler; G. K. McAuliffe; R. S. Wilkov 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 716 KB

Improving reliability bounds in computer

Improving reliability bounds in computer networks

✍ Timothy B. Brecht; Charles J. Colbourn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

The probability that a computer network is operational in an environment of statistically independent link failures has been widely studied. Three natural problems arise, when all nodes are to be connected (all-terminal reliability), when two nodes are to communicate (2-terminal reliability), and wh

Bounding all-terminal reliability in com

Bounding all-terminal reliability in computer networks

✍ Charles J. Colbourn; Daryl D. Harms 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

Triconnected decomposition for computing

Triconnected decomposition for computing K-terminal network reliability

✍ R. Kevin Wood 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

Combinatorial properties of directed gra

Combinatorial properties of directed graphs useful in computing network reliability

✍ A. Satyanarayana; Jane N. Hagstrom 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 455 KB

Complexity of resilient network optimisa

Complexity of resilient network optimisation

✍ Żotkiewicz, Mateusz ;Pióro, Michał ;Tomaszewski, Artur 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB