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

As Taught In
Fall 2008
Level
Learning Resource Types
Lecture Notes
Problem Sets with Solutions