๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A generalization of the Ford-Fulkerson theorem to multipole networks

โœ Scribed by V. L. Kupershtokh

Publisher
Springer US
Year
1974
Tongue
English
Weight
505 KB
Volume
7
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Duality Theorems for a Continuous Analog
Duality Theorems for a Continuous Analog of Ford-Fulkerson Flows in Networks
โœ J.D. Chavez; L.H. Harper ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

T. C. Hu and K. Jacobs independently proposed continuous analogs of Ford-Fulkerson flows in networks. Their models are different, but both showed that there are difficulties in obtaining maxflow \(=\) mincut theorems. In this paper, using a definition of continuous networks which has already been sh

A Generalization of the Riesz Representa
A Generalization of the Riesz Representation Theorem to Infinite Dimensions
โœ Yuh-Jia Lee ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 393 KB

Let C p be the collection of real-valued functions f defined on E &p such that f is uniformly continuous on bounded subsets of Then C is a complete countably normed space equipped with the family [&}& , p : p=1, 2, 3, ...] of norms. In this paper it is shown that to every bounded linear functional

A generalization of the all minors tree
A generalization of the all minors tree theorem to semirings
โœ M. Minoux ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

The 'All Minors Matrix Tree Theorem' (Chen, Applied Graph Theory, Graphs and Electrical Networks, North-Holland, Amsterdam, 1976; Chaiken, SIAM J. Algebraic Discrete Math. 3 (3) (1982) 319-329) is an extension of the well-known 'Matrix Tree Theorem' (Tutte, Proc. Cambridge Philos. Sot. 44 (1948) 463