An efficient algorithm for the minimum capacity cut problem (Q922927)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for the minimum capacity cut problem |
scientific article; zbMATH DE number 4170609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the minimum capacity cut problem |
scientific article; zbMATH DE number 4170609 |
Statements
An efficient algorithm for the minimum capacity cut problem (English)
0 references
1990
0 references
An algorithm to find a minimum cut in a network is presented. The complexity of this algorithm is \(O(n^ 4)\), the same as that given by \textit{R. E. Gomory} and \textit{T. C. Hu} [J. SIAM 9, 551-570 (1961; Zbl 0112.124)]. But, according to the author, this algorithm is easier to implement and empirically superior to the standard algorithm.
0 references
polynomial time algorithm
0 references
minimum cut
0 references
0.8705528378486633
0 references
0.868419885635376
0 references
0.8545825481414795
0 references
