| 基于图论的排课问题 |
| |
| 引用本文： | 蒋政. 基于图论的排课问题[J]. 科技信息, 2010, 0(15): 153-153,191 |
| |
| 作者姓名： | 蒋政 |
| |
| 作者单位： | [1]江南大学信息工程学院,江苏无锡214064 [2]无锡科技职业学院基础部,江苏无锡214028 |
| |
| 摘 要： | 课表的编排过程可以理解为是具体在哪个时间、哪个地点上某一门课程的问题。根据排课过程中必须满足的一些约束条件,利用图论可以解决教师和上课班级在时间和空间上的具体安排。
|
| 关 键 词： | 图论 排课 边着色 匹配 |
Solving Curriculum Arranging Problems with Graph Theory |
| |
| JIANG Zheng. Solving Curriculum Arranging Problems with Graph Theory[J]. Science, 2010, 0(15): 153-153,191 |
| |
| Authors: | JIANG Zheng |
| |
| Affiliation: | JIANG Zheng(1.School of Information Technology,Jiangnan University,Wuxi Jiangsu, 214064,China;2.Section of Basic Science,Wuxi Technology and Professional College,Wuxi Jiangsu, 214028,China) |
| |
| Abstract: | The Curriculum Arranging process can be treated as a specific problem that where and when the courses are arranged. Graph theory can solve the problem on how to schedule teachers and corresponding classes in suitable rooms under certain constraints must be satisfied in scheduling process. |
| |
| Keywords: | Graph Theory Curriculum Scheduling Edge Colouring Matching |
| 本文献已被 维普 等数据库收录！ |
|
