Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
From MaRDI portal
Publication:3499738
DOI10.1007/11847250_19zbMath1154.68425OpenAlexW1584689782MaRDI QIDQ3499738
Jiong Guo, Sebastian Wernicke, Rolf Niedermeier
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_19
Analysis of algorithms and problem complexity (68Q25) 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)
Related Items
A Retrospective on (Meta) Kernelization ⋮ A Moderately Exponential Time Algorithm for Full Degree Spanning Tree ⋮ On the directed full degree spanning tree problem ⋮ A linear kernel for a planar connected dominating set ⋮ Bidimensionality and Kernels ⋮ The parameterized complexity of the induced matching problem ⋮ Kernelization: New Upper and Lower Bound Techniques
