Edge Coloring Model with Matching Restriction
2008
In the simple situation, curriculum arranging schedule can be transformed to an edge coloring model of bipartite graphs, but it only describes the relations of teachers, classes and time, except classrooms, so the model is too simple to solve the practical problem. This paper extends it based on edge coloring through adding the relation of the classroom. The new model can solve the integrated problem.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI