Decision Mathematics 1 (Unit D1-7) by Andrew Higgins https://padlet.com/andrew_j_higgins/D1_7 Matchings Revision en-us 2018-02-22 08:09:38 UTC 2025-05-02 17:42:34 UTC hello@padlet.com https://padlet-assets.s3.amazonaws.com/icons/Watchclock.png Edexcel D1 January 2001 Q4 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234150325 2018-02-22 11:02:09 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234150325 Edexcel D1 January 2002 Q1 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234172176 2018-02-22 12:26:14 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234172176 Edexcel D1 January 2003 Q2 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234177639 2018-02-22 12:45:26 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234177639 Edexcel D1 January 2005 Q1 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234189209 2018-02-22 13:16:32 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234189209 Edexcel D1 January 2006 Q1 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234198549 2018-02-22 13:36:01 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234198549 Edexcel D1 January 2007 Q2 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234206425 2018-02-22 13:50:21 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234206425 Edexcel D1 June 2002 Q3 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234228412 2018-02-22 14:25:01 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234228412 Edexcel D1 June 2003 Q1 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234239215 2018-02-22 14:39:40 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234239215 Edexcel D1 June 2004 Q1 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/234250681 2018-02-22 14:54:59 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/234250681 Tip #1 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/235202279 When finding an alternating path, remember to alternate between the bipartite graph and the initial matching until breakthrough is achieved. It helps to draw these graphs side by side.]]> 2018-02-26 03:23:29 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/235202279 Tip #2 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/235202563 If the question says ... "Explain why it is not possible to find a complete matching" ... give an example to illustrate your answer. These questions are usually worth 2 marks. For example,

Hugo is the only one who can do Task 1 and Task 3. If Hugo is allocated to Task 1, there is no one available to do Task 3 and so a complete matching is not possible]]> 2018-02-26 03:25:03 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/235202563 Tip #3 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/235203457 The maximum matching algorithm adds one edge to the initial matching.]]> 2018-02-26 03:30:51 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/235203457 Tip #4 andrew_j_higgins https://padlet.com/andrew_j_higgins/D1_7/wish/235203599 Remember that a maximum matching may or may not be a complete matching.]]> 2018-02-26 03:31:41 UTC https://padlet.com/andrew_j_higgins/D1_7/wish/235203599