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=10.1.1.89.6749&rep=rep1&type=pdf |
| 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 |
| Date Available | 2009-12-22T07:45:58Z |
| 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 |
Please use this identifier to cite this record: http://hdl.handle.net/10072/27923
Griffith University copyright notice
Copyright in individual works within the repository belongs to their authors or publishers. You may make a print or digital copy of a work for your personal non-commercial use. All other rights are reserved, except for fair dealings or other user rights granted by the copyright laws of your country.
Footer information
Back to top