This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Summary of what you have learned between the two prelims (ENGRI 115, Fall 2007) More graph definitions Bipartite graph. Matching, Maximum matching, perfect matching. Alternating path, alternating tree, exposed node, augmenting path (with respect to a match- ing). Node cover, minimum node cover. Weighted matching, maximum weighted matching (assignment problem). Weighted node cover, minimum weighted node cover. Equality subgraph. Baseball Elimination as Application of MaxFlow How to set up a flow problem to solve the baseball elimination problem. Know how to relate the result of the MaxFlow problem to the original question (whether the team is eliminated or not). The Maximum Matching Problem Applications: Bipartite: Assigning people to jobs, knights to ladies. Non-bipartite: Pairing of pilots who can fly together, roommate assignment in a dorm. Model: Given an undirected graph (bipartite or not) find a maximum cardinality matching....
View Full Document
This note was uploaded on 02/28/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell University (Engineering School).
- Fall '05