✦ LIBER ✦

A decomposition algorithm for multi-terminal networks flows

✍ Scribed by M.T Shing; T.C Hu

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 916 KB
Volume: 13
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90080-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-terminal maximum flows in node-cap

Multi-terminal maximum flows in node-capacitated networks

✍ Frieda Granot; Refael Hassin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 421 KB

Tree decomposition algorithm for large n

Tree decomposition algorithm for large networks

✍ W. J. Blewett; T. C. Hu 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

A decomposition algorithm for network re

A decomposition algorithm for network reliability analysis

✍ A. W. Shogan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 945 KB

## Abstract Consider a directed, source‐sink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source

A decomposition algorithm for network re

A decomposition algorithm for network reliability evaluation

✍ Jacques Carlier; Corinne Lucet 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 895 KB

A multi-GPU algorithm for large-scale ne

A multi-GPU algorithm for large-scale neuronal networks

✍ Raphael Y. de Camargo; Luiz Rozante; Siang W. Song 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

Bounding algorithms for two-terminal net

Bounding algorithms for two-terminal network reliability

✍ G. Thangamani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 418 KB