CS 580's course blog
Wednesday, November 14, 2012
Lecture 32 Max Flow Min Cut Theorem and Ford-Fulkerson's algorithm
In this lecture, we talked about
Ford Fulkerson's algorithm
for finding the max flow. To show the correctness of the algorithm, we also proved the
Max-Flow Min-Cut Theorem
.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment