On the parameterized complexity of spanning trees with small vertex covers

DOI10.1007/978-3-030-39219-2_34zbMath1453.68096OpenAlexW3002469317MaRDI QIDQ779245

Chamanvir Kaur, Neeldhara Misra

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_34

zbMATH Keywords

treewidthvertex coverspanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item

This page was built for publication: On the parameterized complexity of spanning trees with small vertex covers