NPTEL Video Course : NOC:Parameterized Algorithms


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

1x
Search within video (e.g: "algorithm", "compiler" or "coding theory")

                       

Speech Recogniser Status: Not Recognising


    /

            


    DIGIMAT Learning Management Platform