𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multi-terminal maximum flows in node-capacitated networks

✍ Scribed by Frieda Granot; Refael Hassin

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
421 KB
Volume
13
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum flows in probabilistic networks
Maximum flows in probabilistic networks
✍ Hiroshi Nagamochi; Toshihide Ibaraki πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 868 KB
Competitive flow control in general mult
Competitive flow control in general multi-node multi-link communication networks
✍ Ismet Sahin; Marwan A. Simaan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 257 KB

## Abstract In this paper, we consider the flow control in a general multi‐node multi‐link communication network with competing users. Each user has a source node, a destination node, and an existing route for its data flow over any set of links in the network from its source to its destination nod

Overall-terminal reliability of a stocha
Overall-terminal reliability of a stochastic capacitated-flow network
✍ Yi-Kuei Lin πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 607 KB

For a stochastic and directed capacitated-flow network in which the capacity of each arc has several possible values, this article generalizes the system reliability problem from single source node and single sink node cases to an overall-terminal case. Given the demand for each node pair simultaneo

On multiroute maximum flows in networks
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.