Assigned:
Thursday, March 24, 2016
Due:
Thursday, March 31 2016
General Instructions
- Please review the
course information.
- You must write down with whom you worked on the assignment. If this
changes from problem to problem, then you should write down this
information separately with each problem.
- Numbered problems are all from the textbook Network Flows .
Problems
- Suppose that you are given a bipartite graph with a (non-maximum) matching M. Let P be a maximal
set of vertex-disjoint shortest augmenting paths with respoect to M. Give a linear time algorithm to compute P.
- 12.8. Combining two matchings.
- 12.40. Maximal matchings.
Switch to:
[email protected]