Lecture 11b from UW-Madison's Summer 2022 iteration of CS 577: Introduction to Algorithms. This guided problem-solving lecture presented examples of designing polynomial-time reductions for establishing NP-hardness of graph problems.
No download links available.
