On the parameterized complexity of spanning trees with small vertex covers
From MaRDI portal
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Recommendations
Cited in
(5)
This page was built for publication: On the parameterized complexity of spanning trees with small vertex covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779245)