𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Determinants and current flows in electric networks

✍ Scribed by R.L. Brooks; C.A.B. Smith; A.H. Stone; W.T. Tutte

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
603 KB
Volume
100
Category
Article
ISSN
0012-365X

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
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.

Computation of maximal flows in networks
Computation of maximal flows in networks
✍ D. R. Fulkerson; G. B. Dantzig πŸ“‚ Article πŸ“… 1955 πŸ› John Wiley and Sons 🌐 English βš– 350 KB

## Abstract A simple computational method, based on the simplex algorithm of linear programming, is proposed for the following problem: β€œConsider a network (e.g., rail, road, communication network) connecting two given points by way of a number of intermediate points, where each link of the networ