𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A faster parametric minimum-cut algorithm

✍ Scribed by Dan Gusfield; Éva Tardos

Publisher
Springer
Year
1994
Tongue
English
Weight
842 KB
Volume
11
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
✍ J.X. Hao; J.B. Orlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

A simple minimum T-cut algorithm
A simple minimum T-cut algorithm
✍ Romeo Rizzi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 119 KB

We give a simple algorithm for ÿnding a minimum T -cut. At present, all known e cient algorithms for this problem go through the computation of a Gomory-Hu tree. While our algorithm bases on the same fundamental properties of uncrossing as the previous methods, still it provides an ad hoc solution.