A fast algorithm for computing minimum 3-way and 4-way cuts (Q1587938)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1538616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for computing minimum 3-way and 4-way cuts |
scientific article; zbMATH DE number 1538616 |
Statements
A fast algorithm for computing minimum 3-way and 4-way cuts (English)
0 references
28 February 2001
0 references
The authors present a new polynomial algorithm for computing minimum 3-way and 4-way cuts in an edge-weighted graph. The algorithm is extended to the problem of finding a minimum 3-way cut in a symmetric submodular system.
0 references
minimum cut
0 references
polynomial algorithm
0 references
submodular function
0 references
0.8762091398239136
0 references
0.8538447618484497
0 references
