Date: 2009-08-06 03:10:30NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics | | URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical ComputingAdd to Reading ListSource URL: www.mrfellows.netDownload Document from Source Website File Size: 358,61 KBShare Document on Facebook
|