GreedyMaxCut a b w c d e 1

GreedyMaxCut a Edges cut: 0 2

GreedyMaxCut a b Edges cut: 1 3

GreedyMaxCut a b Edges cut: 2 c 4

GreedyMaxCut a b Edges cut: 3 c d 5

GreedyMaxCut a b Edges cut: 3 c d e 6

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

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

Independent Set  Vertex Cover a a b b c d c d e e 9

Maximal matching a b c d e 10

Maximal matching a b c d e 11

Maximal matching and endpoints b c d e 12

Comment cards https://goo.gl/RKd8vq 13

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

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

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