✦ LIBER ✦

Finding a feasible flow in a strongly connected network

✍ Scribed by Bernhard Haeupler; Robert E. Tarjan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a Feasible Schedule on a Tree-Co

✍ Tsuyoshi Kawaguchi; Seiki Kyan; Kenji Onaga 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 770 KB

On finding the strongly connected compon

✍ Esko Nuutila; Eljas Soisalon-Soininen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Routing Flow Through a Strongly Connecte

✍ T. Erlebach and T. Hagerup 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 69 KB

An algorithm for finding a minimal equiv

✍ S. Martello 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 505 KB

On the Existence of a Feasible Flow in A

✍ András Prékopa and Endre Boros 📂 Article 📅 1991 🏛 INFORMS 🌐 English ⚖ 483 KB

A decomposition algorithm for shortest p

✍ P. Brucker 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 161 KB