1. Lecture 19-Problem Solving 4 Incremental Method

2. Min Spanning Tree

3. Minimum Spanning Tree
Could you design an incremental method with the path optimality condition?
Could you design an incremental method with the cut optimality condition?
What is the running time of each designed algorithm?

4. Max Weighted Matching

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

6. Minimum Weight Matching

7. Augmenting Path

8. Optimality Condition

9. Puzzle

10. Chinese Postman

16. Network G = (N, A)
Node set N = {1, 2, 3, 4}
Arc Set A = {(1,2), (1,4), (4,2), (4,3), (2,3)}
In an undirected graph, (i,j) = (j,i)

17. a a

25. Chinese Postman

27. 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.