![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 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](https://www.pdfsearch.io/img/ab2322c5d36d387f6f2eabb005935928.jpg)
| Document Date: 2009-10-14 09:26:19 Open Document File Size: 61,67 KBShare 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 |