✦ LIBER ✦

Maximum flows and minimum cuts in the plane

✍ Scribed by Gilbert Strang

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 199 KB
Volume: 47
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-009-9471-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum concurrent flows and minimum cut

Maximum concurrent flows and minimum cuts

✍ C. K. Cheng; T. C. Hu 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 724 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

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

Cancelling cuts in the regge plane

✍ J.C. Polkinghorne 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 71 KB

Finding the maximum and minimum

✍ Martin Aigner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 681 KB

We consider the problem of finding the maximum out of a list of n ordered items with binary comparisons where the pth fraction of the answers may be false. It is shown that the maximum can be determined iff p < 5 and that a successful strategy needs O(h)" questions. A few similar problems are also d

Approximating the minimum-cost maximum f

Approximating the minimum-cost maximum flow is P-complete

✍ Clifford Stein; Joel Wein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 537 KB