| 赛程安排的图论模型--2002年全国大学生数学建模竞赛D题 |
| |
| 引用本文： | 代西武,李群高,李秀琴. 赛程安排的图论模型--2002年全国大学生数学建模竞赛D题[J]. 北京建筑工程学院学报, 2003, 19(4): 72-76 |
| |
| 作者姓名： | 代西武 李群高 李秀琴 |
| |
| 作者单位： | 基础部,北京,100044 |
| |
| 摘 要： | 通过建立赛程安排的图论模型，圆满解决了2002年全国大学生数学建模竞赛D题的前三个问题。提出了对于任意n支球队进行单循环比赛的赛程编制方法，该方法简单易行，只须手工编排，并证明了该方法编制的赛程使得各队每两场比赛最小相隔的场次数达到了理论上限。
|
| 关 键 词： | 完美匹配 Haimlton-圈 单循环赛 |
| 文章编号： | 1004-6011(2003)04-0072-05 |
| 修稿时间： | 2003-09-26 |
The Graph Model of Match Scheduling |
| |
| Dai Xiwu Li Qungao Li Xiuqin. The Graph Model of Match Scheduling[J]. Journal of Beijing Institute of Civil Engineering and Architecture, 2003, 19(4): 72-76 |
| |
| Authors: | Dai Xiwu Li Qungao Li Xiuqin |
| |
| Abstract: | Establishing the graph model of match scheduling, the first three questions of problem D of 2002's Chinese mathematical contest in modeling are solved satisfactorily. A method to schedule a single-round robin of N teams is proposed. The method is simple and it can be done by hand. Moreover, the following conclusion is proved: In the match schedule made by the method, the minimum number of matches between every two matches of each team reaches the theoretical upper bound. |
| |
| Keywords: | perfect matching hamilton cycle single-round robin |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
