Sciweavers

FSTTCS
2000
Springer

Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems

14 years 3 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algorithm for the Maximum Leaf Spanning Tree problem. Furthermore, we sketch how the methods can be applied to a number of other well-known problems, including the parametric dual of Dominating Set (also known as Nonblocker), Matrix Domination, Edge Dominating Set, and Feedback Vertex Set for Undirected Graphs. The main payo s of these new methods are in improved functions f(k) in the FPT running times, and in general systematic approaches that seem to apply to a wide variety of problems.
Michael R. Fellows, Catherine McCartin, Frances A.
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where FSTTCS
Authors Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
Comments (0)