✦ LIBER ✦

Maximum flows in probabilistic networks

✍ Scribed by Hiroshi Nagamochi; Toshihide Ibaraki

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 868 KB
Volume: 21
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230210604

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum flow in probabilistic communicat

Maximum flow in probabilistic communication networks

✍ S. P. Nawathe; B. V. Rao 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 740 KB

On multiroute maximum flows in networks

✍ Charu C. Aggarwal; James B. Orlin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract Let __G__ = (__N, A__) be a network with a designated source node __s__, a designated sink node __t__, and a finite integral capacity __u~ij~__ on each arc (__i, j__) ∈ __A__. An elementary __K__‐flow is a flow of __K__ units from __s__ to __t__ such that the flow on each arcis 0 or 1.

Maximum flow in probabilistic graphs-the

Maximum flow in probabilistic graphs-the discrete case

✍ J. R. Evans 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 912 KB

## Abstract Frank and Frisch have considered the problem of determining the maximum flow probability distribution in networks where each branch has capacity that is a continuous random variable. In this paper, we consider the branch capacity distributions to be discrete and investigate some theoret

Maximum Balanced Flow in a Network

✍ Haggai Ilani; Michael Lomonosov 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Star-delta transformations of bidirectio

Star-delta transformations of bidirectional branches in probabilistic flow networks

✍ Ali M. Rushdi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Labeling evaluation in probabilistic net

Labeling evaluation in probabilistic networks

✍ Shmuel Peleg 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 463 KB