1. GreedyMaxCut a b w c d e 1

2. GreedyMaxCut a
Edges cut: 0 2

3. GreedyMaxCut a b
Edges cut: 1 3

4. GreedyMaxCut a b
Edges cut: 2 c 4

5. GreedyMaxCut a b
Edges cut: 3 c d 5

6. GreedyMaxCut a b
Edges cut: 3 c d e 6

7. GreedyMaxCut a b
Edges cut: 3 w c d e 7

8. Complement Graphs a a b b c d c d e e 8

9. Independent Set  Vertex Covera a b b c d c d e e 9

10. Maximal matching a b c d e 10

11. Maximal matching a b c d e 11

12. Maximal matching and endpointsb c d e 12

13. Comment cards 13

14. a b w c d e Vertex Cover ---> Max-Cut
w-b, w-c, w-e have weights 1 – 1 = 0 e 14

15. a b w c d e Vertex Cover ---> Max-Cut Edges cut: 6
Edges incident to {a, c}:
a-c, c-d, a-b, a-d w c d
4 *2 - |{a, c}| = 6 e 15

16. a b w c d e Vertex Cover ---> Max-Cut Edges cut: 8
Edges incident to {a, d}:
All 5 edges w c d
5 *2 - |{a, d}| = 8 e 16