✦ LIBER ✦

A Deterministic Algorithm for Finding All Minimum k ‐Way Cuts

✍ Scribed by Kamidoi, Yoko; Yoshida, Noriyoshi; Nagamochi, Hiroshi

Book ID: 118180683
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 228 KB
Volume: 36
Category: Article
ISSN: 0097-5397
DOI: 10.1137/050631616

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for computing minimum 3

A fast algorithm for computing minimum 3-way and 4-way cuts

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 103 KB

A Faster Algorithm for Computing Minimum

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

✍ Hiroshi Nagamochi; Shigeki Katayama; Toshihide Ibaraki 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 234 KB

Efficient algorithm for finding all mini

Efficient algorithm for finding all minimal edge cuts of a nonoriented graph

✍ A. V. Karzanov; E. A. Timofeev 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 524 KB

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

An O(K·n4) algorithm for finding the k b

An O(K·n4) algorithm for finding the k best cuts in a network

✍ Horst Hamacher 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Computational results on an algorithm fo

Computational results on an algorithm for finding all vertices of a polytope

✍ T. H. Mattheiss; Brian K. Schmidt 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 627 KB