Matching and allocation problems
Videos in this series
Please select a video from the same chapter
Video Images
Video Images
Video Images
Video Images
Chapters
Introduction
Welcome
Learning objectives
Recap of past learning
Bipartite graphs
Directed bipartite graphs
The Hungarian Algorithm
Example
Final words
Please subscribe
Matching and allocation problems
Flow, matching and scheduling problems
Year 12
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.
Published: July 2, 2021
Length: 00 mins and 00 seconds
Lesson notes

Lesson notes are provided in PDF format and can be downloaded by clicking the link below:
Exam resources

There are currently no associated exam questions for this topic.

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
LEGAL STUFF

Where videos relate to VCE and I have used VCAA questions the following should be noted:
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 www.vcaa.vic.edu.au