✦ LIBER ✦

Combinatorial properties of directed graphs useful in computing network reliability

✍ Scribed by A. Satyanarayana; Jane N. Hagstrom

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 455 KB
Volume: 11
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230110405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The structure of max ?-minm?+1 graphs us

The structure of max ?-minm?+1 graphs used in the design of reliable networks

✍ Wang, Guifang; Zhang, Lianzhu 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

It was proved that the design problem of the reliable networks for ''small'' edge failure probability is equivalent to finding a max l-min m l graph for given numbers of nodes n and edges e with l Å [2e/n] by Bauer et al. Furthermore, at least a max l-min m l graph was given for each pair of n and e

ChemInform Abstract: Strategies for the

ChemInform Abstract: Strategies for the Use of Mixture-Based Synthetic Combinatorial Libraries: Scaffold Ranking, Direct Testing in vivo, and Enhanced Deconvolution by Computational Methods.

✍ Richard A. Houghten; et al. et al. 📂 Article 📅 2008 🏛 John Wiley and Sons ⚖ 15 KB 👁 2 views