Finding <i>k</i> Cuts within Twice the Optimal (Q4326855)
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: Finding k Cuts within Twice the Optimal |
scientific article; zbMATH DE number 736890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding <i>k</i> Cuts within Twice the Optimal |
scientific article; zbMATH DE number 736890 |
Statements
Finding <i>k</i> Cuts within Twice the Optimal (English)
0 references
27 March 1995
0 references
graph partitioning
0 references
minimum \(k\)-cut problem
0 references
