6.854J | Fall 2008 | Graduate

Advanced Algorithms

Study Materials

Lecture 11

Description:

Lecture notes on an algorithm that computes the minimum cut (or simply mincut) in an undirected graph.

Course Info

Fall 2008

Course Info

Fall 2008
Lecture Notes
Problem Set Solutions
Problem Sets