NPTEL Video Course : NOC:Parameterized Algorithms

Lecture 48 - Reductions - Problems as Hard as Clique I (Clique on Regular Graphs)