NPTEL Video Course : NOC:Parameterized Algorithms

Lecture 50 - Reductions - Problems as Hard as Clique (Dominating Set, Set Cover)