𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

✍ Scribed by Hiroshi Nagamochi; Shigeki Katayama; Toshihide Ibaraki

Book ID
110281392
Publisher
Springer US
Year
2000
Tongue
English
Weight
234 KB
Volume
4
Category
Article
ISSN
1382-6905

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