Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs
From MaRDI portal
(Redirected from Polynomial-time approximation scheme for minimum k-cut in planar and minor-free graphs)
Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs
Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
