Back to Results
First PageMeta Content
NP-complete problems / Parameterized complexity / Kernelization / Dominating set / Vertex cover / Path decomposition / Planar separator theorem / Clique problem / Graph coloring / Theoretical computer science / Graph theory / Mathematics


Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow
Add to Reading List

Document Date: 2009-10-05 20:16:31


Open Document

File Size: 121,41 KB

Share Result on Facebook
UPDATE