Video details loaded

Lecture 9: Graph Problems

1:20:26

Up Next

Lecture 10: Inapproximabililty Overview

Description: In this lecture, Professor Demaine finishes up NP-hardness, and the various techniques involved in such proofs.

Instructor: Erik Demaine

A video player with synced slides and lecture notes is available.