✦ LIBER ✦

Hypermedia and network reliability

✍ Scribed by Lavon B. Page; Jo Ellen Perry

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 809 KB
Volume: 28
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(88)90014-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Network reliability and acyclic orientat

Network reliability and acyclic orientations

✍ R. Johnson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 934 KB

Reliability and communications networks

✍ Anil P. Macwan; Robert S. Hanmer; Kailash K. Mutha 📂 Article 📅 2006 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 172 KB

Network reliability and the factoring th

Network reliability and the factoring theorem

✍ A. Satyanarayana; Mark K. Chang 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 809 KB

Dense network traffic models, travel tim

Dense network traffic models, travel time reliability and traffic management. Ii: Application to network reliability

✍ Michael A P Taylor 📂 Article 📅 1999 🏛 Institute for Transportation Inc. 🌐 English ⚖ 776 KB

This paper is the second of a pair of papers discussing two main themes concerning dense network modelling. These themes are: (1) the changing nature of traffic management technology and the underlying objectives behind traffic management practice, and (2) the use of measures of network reliability

Special issue: Network reliability and t

Special issue: Network reliability and transport modelling

✍ William H. K. Lam 📂 Article 📅 1999 🏛 Institute for Transportation Inc. 🌐 English ⚖ 156 KB 👁 1 views

With increasing demands for better and reliable service due to improvements in the quality of life, many systems (such as the communication networks and drainage systems) have incorporated "reliability analysis" as an integral part in their planning, design and operation. However, very little attent

Edge-packing of graphs and network relia

Edge-packing of graphs and network reliability

✍ Charles J. Colbourn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 842 KB

The reliability of a network can be efficiently bounded using graph-theoretical techniques based on edge-packing. We examine the application of combinatorial theorems on edgepacking spanning trees, s, t-paths, and s, t-cuts to the determination of reliability bounds. The application of spanning tree