![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 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](https://www.pdfsearch.io/img/8655334823b95e8dbccbfc21fcfa79ea.jpg) Date: 2009-10-05 20:16:31NP-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 mfellowAdd to Reading ListSource URL: www.mrfellows.netDownload Document from Source Website File Size: 121,41 KBShare Document on Facebook
|