Tuesday, 1 November 2011

Weds Nov 2nd – Bipartite Graphs - Matchings

LEARNING OBJECTIVE: Discover how to model a problem using a bipartite graph and solve problems using the maximum matching algorithm

SUCCESS CRITERIA: You will be able to solve matching problems using the maximum matching algorithm

LESSON:

Quick reminder of What a Bipartite graph is using screens 3 & 4 of this Lesson. Use the examples to show how to find some possible matchings

You Should now be able to answer the three questions in Exercise 7a (Photocopy masters are available)

Explore finding matchings using this Lesson – using the example screens and problems with students.

If time allows continue with This lesson exploring the maximum matching algorithm

PLENARY: Checking understanding of students – preparation for Fridays lesson – Period 1 more on Matching with a chance to have a go at some questions. Period 2 – Test on Chapters 4 5 & 6

No comments:

Post a Comment