CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 19

Last update November 11, 2003

Topics References

1. Applications of Max Flow

2 dimensional matching, no. of vertex disjoint paths

no. of edge disjoint paths, job scheduling,

max flow - min cut

2. Feasible Flow Hand outs

Example of Computation

Back to Lectures Home Page

Back to CS600 Home Page

Back to Toida's Home Page

Topics	References

1. Applications of Max Flow
2 dimensional matching, no. of vertex disjoint paths
no. of edge disjoint paths, job scheduling,
max flow - min cut
2. Feasible Flow	Hand outs
Example of Computation