✦ LIBER ✦

Maximum concurrent flows and minimum cuts

✍ Scribed by C. K. Cheng; T. C. Hu

Publisher: Springer
Year: 1992
Tongue: English
Weight: 724 KB
Volume: 8
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758845

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum flows and minimum cuts in the pl

Maximum flows and minimum cuts in the plane

✍ Gilbert Strang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 199 KB

Sparsest cuts and concurrent flows in pr

Sparsest cuts and concurrent flows in product graphs

✍ Paul Bonsma 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 300 KB

A cut [S; S] is a sparsest cut of a graph G if its cut value |S S|=|[S; S]| is maximum (this is the reciprocal of the well-known edge-density of the cut). In the (undirected) uniform concurrent ow problem on G, between every vertex pair of G ow paths with a total ow of 1 have to be established. The

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

A new—old algorithm for minimum-cut and

A new—old algorithm for minimum-cut and maximum-flow in closure graphs

✍ Dorit S. Hochbaum 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

Minimum cuts and related problems

✍ J. C. Picard; H. D. Ratliff 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 520 KB

Minimum cuts, modular functions, and mat

Minimum cuts, modular functions, and matroid polyhedra

✍ William H. Cunningham 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 694 KB

The minimum cut problem is a well-solved special case of submodular function minimization. We show that it is in fact equivalent to minimizing a modular function over a ring family. Onehalf of this equivalence follows from classical work of Rhys and Picard. We give a number of applications to testin