1 / 48

Lecture 16 Maximum Matching

Lecture 16 Maximum Matching. Incremental Method. Transform from a feasible solution to another feasible solution to increase (or decrease) the value of objective function. Matching in Bipartite Graph. Maximum Matching. 1. 1. Note: Every edge has capacity 1.

minerva-keith
Download Presentation

Lecture 16 Maximum Matching

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 16 Maximum Matching

  2. Incremental Method • Transform from a feasible solution to another feasible solution to increase (or decrease) the value of objective function.

  3. Matching in Bipartite Graph Maximum Matching

  4. 1 1

  5. Note: Every edge has capacity 1.

  6. 1. Can we do augmentation directly in bipartite graph? 2. Can we do those augmentation in the same time?

  7. 1. Can we do augmentation directly in bipartite graph? Yes!!!

  8. Alternative Path

  9. Optimality Condition

  10. Puzzle

  11. Extension to Graph

  12. Matching in Graph Maximum Matching

  13. Note • We cannot transform Maximum Matching in Graph into a maximum flow problem. • However, we can solve it with augmenting path method.

  14. Alternative Path

  15. Optimality Condition

  16. 2. Can we do those augmentation in the same time?

  17. Hopcroft–Karp algorithm • The Hopcroft–Karp algorithm may therefore be seen as an adaptation of the Edmonds-Karp algorithm for maximum flow.

  18. In Each Phase

  19. Running Time Reading Material

  20. Max Weighted Matching

  21. Maximum Weight Matching It is hard to be transformed to maximum flow!!!

  22. Minimum Weight Matching

  23. Augmenting Path

  24. Optimality Condition

  25. Chinese Postman

  26. Minimum Weight Perfect Matching • Minimum Weight Perfect Matching can be transformed to Maximum Weight Matching. • Chinese Postman Problem is equivalent to Minimum Weight Perfect Matching in graph on odd nodes.

  27. Thanks, end.

More Related