| 巩子坤.单循环比赛赛程编排的一个模型[J].南华大学学报(自然科学版),2003,(2):24~26.[.A Model of the Arrangement of the Games of Several Teams in Single Robin[J].Journal of University of South China(Science and Technology),2003,(2):24~26.] |
| 单循环比赛赛程编排的一个模型 |
| A Model of the Arrangement of the Games of Several Teams in Single Robin |
| 修订日期：2003-02-25 |
| DOI： |
| 中文关键词: 算法,单循环比赛,完全图 |
| 英文关键词:algorithm,single robin,complete graph |
| 基金项目: |
| 巩子坤 |
| 西南师范大学数学系 重庆北碚400715，枣庄师范高等专科学校数学与信息科学系，山东枣庄277160 |
| 摘要点击次数: 807 |
| 全文下载次数: 2 |
| 中文摘要: |
| 对n支球队单循环比赛的赛程问题 ,在使赛程对各支球队来说尽可能公平的条件下 ,给出一了个赛程编排算法 .该算法可以给出各支球队每两场比赛相隔场数的最小值的上限值为 [(n- 3) 2 ].利用这个算法 ,我们给出了n=9时各支球队每两场比赛相隔场数的最小值达到上限 3的具体赛程编排 .最后 ,我们讨论了衡量一个赛程优劣的另外一些指标 . |
| 英文摘要: |
| As far as the arrangement of the games of several teams in single robin is concerned,it is given a algorithm of the arrangement so that the games are as equal as possible. According to this algorithm,we can calculate the upper limit of minimum of every two games apart. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| 关闭 |
|
|
|