The Karger-Stein algorithm is optimal for k-cut (Q5144935)
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 7298263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Karger-Stein algorithm is optimal for k-cut |
scientific article; zbMATH DE number 7298263 |
Statements
The Karger-Stein algorithm is optimal for k-cut (English)
0 references
19 January 2021
0 references
graph algorithms
0 references
minimum cut
0 references
randomized algorithms
0 references
