Matching and allocation problems
Flow, matching and scheduling problems
General Maths Units 3 and 4 (2023+)
MaffsGuru Logo Sitting
Videos in this series
Please select a video from the same chapter
Video Images Video Images Video Images Video Images

  Learning objectives
  Recap of past learning
  Bipartite graphs
  Directed bipartite graphs
  The Hungarian Algorithm
  Final words
  Please subscribe

This next video in the Networks series for the Further Maths course sees me looking at the interesting topic of Matching and Allocation problems. It really doesn't get more exciting than this. I look at what bipartite graphs and how they can be used to solve matching problems using The Hungarian Algorithm. I also discuss the different types of bipartite graphs; namely, connected and directed. There are some worked examples and all the theory is explained in an easy to understand way.
VCE Maths exam question content used by permission, ©VCAA. The VCAA is not affiliated with, and does not endorse, this video resource. VCE® is a registered trademark of the VCAA. Past VCE exams and related content can be accessed at

There are no current errors with this video ... phew!

Click the link below to download your notes.
If your lesson notes are not downloading this is due to your school blocking access to the notes server. If you try connecting at home, or using a different computer which is not controlled by your school, you will be able to download the notes.
Video tags

vce maths maths tutorials bipartite graph connected bipartite graph directed bipartite graph the hungarian algorithm allocation problems Matching and allocation problems Further Maths Units 3 and 4 year 12 maths unit 3 and 4 maths further maths grade 12 maths