𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time

✍ Scribed by Karsten Weihe


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
634 KB
Volume
55
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis


Let G=(V, A) be a directed, planar graph, let s, t # V, s{t, and let c a >0 be the capacity of an arc a # A. The problem is to find a maximum flow from s to t in G subject to these capacities. The best asymptotic bound known so far is O(n log n } min[-n, 3

n log C]), where n= |V | and C= a # A c a . We introduce a new algorithm, which requires only O(n log n) time.


πŸ“œ SIMILAR VOLUMES


Edge-Disjoint (s, t)-Paths in Undir
✍ 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
✍ V. Adlakha; B. Gladysz; J. Kamburowski πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 340 KB