A divide-and-conquer approach to the minimum \(k\)-way cut problem. (Q5957576)
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: A divide-and-conquer approach to the minimum k-way cut problem. |
scientific article; zbMATH DE number 1717731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer approach to the minimum \(k\)-way cut problem. |
scientific article; zbMATH DE number 1717731 |
Statements
A divide-and-conquer approach to the minimum \(k\)-way cut problem. (English)
0 references
2002
0 references
0.9179558157920836
0 references
