Parameterized algorithm for the disjoint path problem on planar graphs: exponential in k^2 and linear in n
From MaRDI portal
Publication:6538679
This page was built for publication: Parameterized algorithm for the disjoint path problem on planar graphs: exponential in \(k^2\) and linear in \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538679)
