![NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph coloring / Kernelization / Dominating set / Feedback vertex set / Vertex cover / Tree decomposition / Theoretical computer science / Graph theory / Computational complexity theory NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph coloring / Kernelization / Dominating set / Feedback vertex set / Vertex cover / Tree decomposition / Theoretical computer science / Graph theory / Computational complexity theory](https://www.pdfsearch.io/img/dd0025491d339179571219ca49c7c7e0.jpg) Date: 2009-09-08 08:50:37NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory | | 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000Add to Reading ListSource URL: mrfellows.netDownload Document from Source Website File Size: 539,32 KBShare Document on Facebook
|