Assigned:
Thursday, April 23, 2009
Due:
(Optional) Thursday, April 30, 2009
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
- 12.34, 12.35. Running the non-bipartite matching algorithm.
- 12.36. A quandry.
- 12.38. Matchable nodes.
- 12.42 Unmatchable edges.
Switch to:
[email protected]