First Page | Document Content | |
---|---|---|
Date: 2011-04-05 11:38:18NP-complete problems NP-complete Clique problem Clique Independent set Parameterized complexity Dominating set Travelling salesman problem NP Theoretical computer science Computational complexity theory Mathematics | Add to Reading ListSource URL: faculty.cs.tamu.eduDownload Document from Source WebsiteFile Size: 178,43 KBShare Document on Facebook |