Efficient algorithms for k-terminal cuts on planar graphs

From MaRDI portal
(Redirected from Efficient algorithms for k-terminal cuts on planar graphs)
Efficient algorithms for \(k\)-terminal cuts on planar graphs (scientific article; zbMATH DE number 2081002)















This page was built for publication: Efficient algorithms for \(k\)-terminal cuts on planar graphs

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