An efficient algorithm for the minimum capacity cut problem (Q922927): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:38, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the minimum capacity cut problem |
scientific article |
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
