Bipartite Matching Transparencies:

• pg. 1
• pg. 2
• pg. 3
• pg. 4
• pg. 5
• pg. 6
• pg. 7
• pg. 8
• pg. 9
• pg. 10
• pg. 11
• pg. 12
• pg. 13
• pg. 14
• pg. 15
• pg. 16
• pg. 17
• pg. 18
• pg. 19
• pg. 20
• pg. 21
• pg. 22
• pg. 23
• pg. 24
• pg. 25
• pg. 26
• pg. 27
• pg. 28
• pg. 29
• pg. 30
• pg. 31
• pg. 32
• pg. 33
• pg. 34
• pg. 35
• pg. 36
• pg. 37
• pg. 38
• pg. 39
• MHT of more than 2 trees (4 transparencies)
• Proof of theorem (7 transparencies)
• Approximation algorithm (2 transparencies)
• first 10 transparencies - synchronous
• transparencies 10-20 - synchronous
• transparencies 20-30 - synchronous
• transparencies 30-40 - synchronous
• transparencies 40-51 - synchronous
• first 5 transparencies - online algorithms
• transparencies 6-10 - online algorithms
• transparencies 11-15 - online algorithms
• information retrieval
• linear programming