MIT
Lecture 9: Graph Problems
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering
Om kurset
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.