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
Download File

Course Info

Departments
As Taught In
Spring 2008
Level
Undergraduate
Topics
Learning Resource Types
Exam Solutions
Exams
Lecture Notes
Presentation Assignments with Examples
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology