First Page | Document Content | |
---|---|---|
![]() Date: 2013-01-31 16:33:06NP-complete problems Analysis of algorithms Parameterized complexity Dominating set Kernelization Vertex cover Path decomposition Tree decomposition Time complexity Theoretical computer science Computational complexity theory Graph theory | Source URL: fpt.wdfiles.comDownload Document from Source WebsiteFile Size: 192,82 KBShare Document on Facebook |