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
Course Info
Instructors
Departments
As Taught In
Spring
2008
Level
Course Info
Instructors
Departments
As Taught In
Spring
2008
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
assignment_turned_in
Presentation Assignments with Examples
assignment
Problem Sets