✦ LIBER ✦

On mimicking networks representing minimum terminal cuts

✍ Scribed by Khan, Arindam; Raghavendra, Prasad

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on finding minimum cuts in direct

✍ Ladislav Janiga; Vaclav Koubek 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 251 KB

On the structure of all minimum cuts in

✍ Jean-Claude Picard; Maurice Queyranne 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 16 KB

On the relationship between the cut-tree

✍ Salah E. Elmaghraby 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A note on the article “A robust branch-a

✍ R. Montemanni; L.M. Gambardella 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 99 KB

[Mathematical Programming Studies] Combi

✍ Rayward-Smith, V. J. 📂 Article 📅 1980 🏛 Springer Berlin Heidelberg ⚖ 401 KB