✦ LIBER ✦

An $\NC$ Algorithm for Minimum Cuts

✍ Scribed by Karger, David R.; Motwani, Rajeev

Book ID: 118177401
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 338 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539794273083

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for the minimum c

An efficient algorithm for the minimum capacity cut problem

✍ M. Padberg; G. Rinaldi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 757 KB

Implementing an efficient minimum capaci

Implementing an efficient minimum capacity cut algorithm

✍ Hiroshi Nagamochi; Tadashi Ono; Toshihide Ibaraki 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 900 KB

A Deterministic Algorithm for Finding Al

A Deterministic Algorithm for Finding All Minimum k ‐Way Cuts

✍ Kamidoi, Yoko; Yoshida, Noriyoshi; Nagamochi, Hiroshi 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 228 KB

A Multiterminal Minimum Cut Algorithm fo

A Multiterminal Minimum Cut Algorithm for Planar Graphs

✍ Shiloach, Yossi 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 628 KB

Structural and algorithmic properties fo

Structural and algorithmic properties for parametric minimum cuts

✍ Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 507 KB

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.