The number of minimum \(k\)-cuts: improving the Karger-Stein bound (Q5212764)
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 7160504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of minimum \(k\)-cuts: improving the Karger-Stein bound |
scientific article; zbMATH DE number 7160504 |
Statements
The number of minimum <i>k</i> -cuts: improving the Karger-Stein bound (English)
0 references
30 January 2020
0 references
extremal graph theory
0 references
graph algorithms
0 references
graph cuts
0 references
minimum \(k\)-cut
0 references
0.8276684284210205
0 references
0.8224412798881531
0 references
0.8143249750137329
0 references
