D1 January 2010 Q1

EdexcelOld spec6 marksAllocation

1.

Figure 1: bipartite graph; A to 1 and 2; B to 3 and 4; C to 1, 3 and 6; D to 4 and 5; E to 1, 2 and 5; F to 3 and 4
Figure 1

Figure 1 shows the possible allocation of six people, Alice (A), Brian (B), Christine (C), David (D), Elizabeth (E) and Freddy (F), to six tasks, 1, 2, 3, 4, 5 and 6.

An initial matching is Alice to task 1, Christine to task 3, David to task 4 and Elizabeth to task 5.

(a) Show this initial matching on Diagram 1 in the answer book. (1)
(b) Starting from this initial matching, use the maximum matching algorithm to find a complete matching.  List clearly the alternating paths that you use, and give your final matching. (5)