Lecture 22: Applications of Max-flow, Bipartite matching, edge- and node- disjoint paths
We discussed applications of the max-flow algorithm such as solving bipartite matching, and finding edge- and node- disjoint paths.
To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video