FPT is P-Time Extremal Structure I
No Thumbnail Available
File version
Author(s)
Estivill-Castro, Vladimir
Fellows, M ichael
Langston, Michael
Rosamond, Frances
Fellows, M ichael
Langston, Michael
Rosamond, Frances
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Hajo Broersma, Matthew Johnson, Stefan Szeider
Date
2005
Size
File type(s)
Location
Durham UK
License
Abstract
We describe a broad program of research in parameterized complexity, and hows this plays out for the MAX LEAF SPANNING TREE problem.
Journal Title
Conference Title
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop