Study Materials
Lecture 11
Description:
Lecture notes on an algorithm that computes the minimum cut (or simply mincut) in an undirected graph.
pdf
814 kB
Lecture 11
Course Info
Instructor
As Taught In
Fall
2008
Level
Learning Resource Types
notes
Lecture Notes
assignment_turned_in
Problem Sets with Solutions