Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs

From MaRDI portal

(Redirected from Publication:5236249)
Polynomial-time approximation scheme for minimum \(k\)-cut in planar and minor-free graphs

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Polynomial-time_approximation_scheme_for_minimum_%5C(k%5C)-cut_in_planar_and_minor-free_graphs&oldid=91664477"