Back to Results
First PageMeta Content
Analysis of algorithms / NP-complete problems / Parameterized complexity / Kernelization / Dominating set / Time complexity / Algorithm / Mathematical optimization / NP / Theoretical computer science / Computational complexity theory / Applied mathematics


LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
Add to Reading List

Document Date: 2009-10-14 09:26:19


Open Document

File Size: 61,67 KB

Share Result on Facebook

Company

Vertex / /

Country

Australia / /

/

Facility

University Drive / Computer Science University of Newcastle / /

IndustryTerm

polynomial-time pre-processing rules / unsophisticated pre-processing / computing / modulo polynomial-time pre-processing / bounded search trees / /

Organization

Practical Computing Michael R. Fellows School of Electrical Engineering / University of Newcastle / /

Person

Langston / /

Technology

rst FPT algorithm / ESA / improved FPT algorithms / FPT algorithms / currently known algorithm / /

SocialTag