𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Simple and Fast Min-Cut Algorithm

✍ Scribed by Michael Brinkmeier

Publisher
Springer
Year
2007
Tongue
English
Weight
488 KB
Volume
41
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast hypergraph min-cut algorithm for
A fast hypergraph min-cut algorithm for circuit partitioning
✍ Wai-Kei Mak; D.F. Wong πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 215 KB

Circuit partitioning is one of the central problems in VLSI system design. The primary objective of circuit partitioning is to minimize the number of interconnections between di!erent components of the partitioned circuit. So the circuit partitioning problem is closely related to the minimum cut pro

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.

A Simple Algorithm for the Planar Multiw
A Simple Algorithm for the Planar Multiway Cut Problem
✍ Wei-Chang Yeh πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota