Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
From MaRDI portal
Publication:3499738
DOI10.1007/11847250_19zbMath1154.68425MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A Retrospective on (Meta) Kernelization, On the directed full degree spanning tree problem, A linear kernel for a planar connected dominating set, The parameterized complexity of the induced matching problem, Bidimensionality and Kernels, A Moderately Exponential Time Algorithm for Full Degree Spanning Tree, Kernelization: New Upper and Lower Bound Techniques