6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

Lecture 14: Searching III: Toplogical Sort and NP-completeness

Description:

Lecture notes on searching, BFS vs. DFS, job scheduling, topological sort, intractable problems, P, NP, and NP-completeness.

Resource Type:
Lecture Notes
pdf
680 kB
Lecture 14: Searching III: Toplogical Sort and NP-completeness
Learning Resource Types
Problem Sets
Exams with Solutions
Lecture Notes
Presentation Assignments with Examples