✦ LIBER ✦

Min/max bounds for dynamic network flows

✍ Scribed by W. L. Wilkinson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for min-max heaps

✍ A. Hasham; J. -R. Sack 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 589 KB

Improved bounds on the max-flow min-cut

✍ Serge Plotkin; Éva Tardos 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 671 KB

Max–min utility fair flow management for

✍ Izhak Rubin; Runhe Zhang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

On the relation of max-flow to min-cut f

✍ P. Simin Pulat 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Maximum flow problem on dynamic generati

✍ Hassan Salehi Fathabadi; Seyed Ahmad Hosseini 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 345 KB

Dynamic network flows for generalized ki

✍ V. V. Ostapenko; A. I. Pavlygin 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 307 KB