FPT is P-Time Extremal Structure I

There are no files associated with this record.

Title FPT is P-Time Extremal Structure I
Author Estivill-Castro, Vladimir; Fellows, Michael; Langston, Michael; Rosamond, Frances
Publication Title Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop
Editor Hajo Broersma, Matthew Johnson, Stefan Szeider
Year Published 2005
Place of publication Berlin
Publisher Springer
Abstract We describe a broad program of research in parameterized complexity, and hows this plays out for the MAX LEAF SPANNING TREE problem.
Peer Reviewed No
Published Yes
Publisher URI http://citeseerx.ist.psu.edu/viewdoc/download?doi=
ISBN 1-904987-10-9
Conference name First ACiD Workshop
Location Durham UK
Date From 2005-07-08
Date To 2005-07-10
URI http://hdl.handle.net/10072/27923
Date Accessioned 2006-07-18
Language en_AU
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Engineering and Information Technology
Subject PRE2009-Analysis of Algorithms and Complexity
Publication Type Conference Publications (Full Written Paper - Non-Refereed)
Publication Type Code e2

Show simple item record

Griffith University copyright notice