A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs (Q4938664)
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: Publication:4938664 |
scientific article; zbMATH DE number 1405683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs |
scientific article; zbMATH DE number 1405683 |
Statements
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs (English)
0 references
23 February 2000
0 references
minimum \(k\)-way cut problem
0 references
partition
0 references
deterministic algorithm
0 references
maximum flow
0 references
0.9890918135643004
0 references
0.8812530040740967
0 references
