Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs (Q6083468)
From MaRDI portal
scientific article; zbMATH DE number 7774326
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs |
scientific article; zbMATH DE number 7774326 |
Statements
Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs (English)
0 references
8 December 2023
0 references
graph sparsification
0 references
minimum-cut algorithms
0 references
