A faster algorithm for computing minimum 5-way and 6-way cuts in graphs (Q1583693)
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 faster algorithm for computing minimum 5-way and 6-way cuts in graphs |
scientific article; zbMATH DE number 1523204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for computing minimum 5-way and 6-way cuts in graphs |
scientific article; zbMATH DE number 1523204 |
Statements
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs (English)
0 references
30 October 2000
0 references
minimum cuts
0 references
graphs
0 references
\(k\)-way cuts
0 references
polynomial algorithm
0 references
