𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Faster Algorithm for Finding Minimum Tucker Submatrices

✍ Scribed by Guillaume Blin, Romeo Rizzi, Stéphane Vialette

Book ID
113023334
Publisher
Springer
Year
2012
Tongue
English
Weight
473 KB
Volume
51
Category
Article
ISSN
1433-0490

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