Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

Computer Engineering ›› 2008, Vol. 34 ›› Issue (3): 111-112,.

• Software Technology and Database • Previous Articles     Next Articles

Edge Coloring Model with Matching Restriction

SUN Bo, ZHONG Sheng   

  1. (College of Information Science and Technology, Hainan University, Haikou 570000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-02-05 Published:2008-02-05

匹配限制着色排课模型

孙 波,钟 声   

  1. (海南大学信息科学技术学院,海口 570000)

Abstract: 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.

Key words: curriculum arranging schedule, edge coloring, bipartite graph, three-partite graph

摘要: 在简化的情况下,排课问题可以转化为二分图的边着色问题,但它只解决了教师、班级的排课,未涉及教室问题,离实际应用有很大差距。该文使用扩展的边着色理论,同时考虑教师、班级和教室三者的关系,提出了使用匹配限制着色来解决完整的课表安排问题。

关键词: 排课, 边着色, 二分图, 三分图

CLC Number: