TA assignments
•
Bipartite graph – 2 node types (TAs and Courses)
•
Maximal matching (assign as many TAs to as many
courses as possible)