Polynomial-time Approximation Scheme for Minimum <i>k</i>-cut in Planar and Minor-free Graphs (Q5236249)
From MaRDI portal
scientific article; zbMATH DE number 7117414
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time Approximation Scheme for Minimum <i>k</i>-cut in Planar and Minor-free Graphs |
scientific article; zbMATH DE number 7117414 |
Statements
Polynomial-time Approximation Scheme for Minimum <i>k</i>-cut in Planar and Minor-free Graphs (English)
0 references
15 October 2019
0 references
