✦ LIBER ✦

Minimum flows in (s,t) planar networks

✍ Scribed by V. Adlakha; B. Gladysz; J. Kamburowski

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 340 KB
Volume: 21
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230210705

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum-cost flows in convex-cost networ

Minimum-cost flows in convex-cost networks

✍ T. C. Hu 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

Maximum (s, t)-Flows in Planar Netw

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

✍ Karsten Weihe 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 634 KB

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

A simplex algorithm for minimum-cost net

A simplex algorithm for minimum-cost network-flow problems in infinite networks

✍ Thomas C. Sharkey; H.Edwin Romeijn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

The complexity of minimum cut and maximu

The complexity of minimum cut and maximum flow problems in an acyclic network

✍ Vijaya Ramachandran 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

Estimation of flows and temperatures in

Estimation of flows and temperatures in process networks

✍ G. M. Stanley; R. S. H. Mah 📂 Article 📅 1977 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 935 KB

Disjoint (s, t)-cuts in a network

✍ Donald K. Wagner 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 638 KB