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

Disjoint (s, t)-cuts in a network

โœ Scribed by Donald K. Wagner

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
638 KB
Volume
20
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Disjoint paths in a network
Disjoint paths in a network
โœ J. W. Suurballe ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 931 KB
On finding the K best cuts in a network
On finding the K best cuts in a network
โœ Horst W. Hamacher; Jean-Claude Picard; Maurice Queyranne ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB
Edge-Disjoint (s, t)-Paths in Undir
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time
โœ Karsten Weihe ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

We consider the following problem. Let G s V, E be an undirected planar graph and let s, t g V, s / t. The problem is to find a set of pairwise edge-disjoint paths in G, each connecting s with t, of maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fast

Minimum flows in (s,t) planar networks
Minimum flows in (s,t) planar networks
โœ V. Adlakha; B. Gladysz; J. Kamburowski ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 340 KB