✦ LIBER ✦

The maximum flow problem is log space complete for P

✍ Scribed by Leslie M. Goldschlager; Ralph A. Shaw; John Staples

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating linear programming is log-

✍ Maria Serna 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Approximating the minimum-cost maximum f

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

The binary network flow problem is logsp

✍ Thomas Lengauer; Klaus W. Wagner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 704 KB

An Incremental Algorithm for the Maximum

✍ S. Kumar; P. Gupta 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 129 KB

A simple GAP-canceling algorithm for the

✍ Mateo Restrepo; David P. Williamson 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 577 KB

A Mathematical Study of the Relaxed Opti

✍ Aubert, G.; Kornprobst, P. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 511 KB