Question: Three teachers x 1 , x 2 , x 3 teach four classes y 1 , y 2 , y 3 , y 4 for
Three teachers x1, x2, x3 teach four classes y1, y2, y3, y4 for these numbers of periods:

Show that this arrangement can be represented by a bipartite graph G and that a teaching schedule for one period corresponds to a matching in G. Set up a teaching schedule with the smallest possible number of periods.
X1 2 X3 1 1 0 2 0 1 1 Y3 1 1 4 1
Step by Step Solution
3.37 Rating (156 Votes )
There are 3 Steps involved in it
X1 X2 X3 1... View full answer
Get step-by-step solutions from verified subject matter experts
