摘要
为解决2n名选手循环赛安排问题,给出了边矩阵及循环赛图的定义.提出了求K2n的Δ(G)个完备匹配M(i)的一种算法.介绍了8名选手循环赛图K(81)及16名选手循环赛图K(161)的形成过程.讨论了完备匹配不交的循环赛图K(2 in)的个数问题.
To solve the round-robin tournament arrangement problem of 2n players the definitions about both edge matrix and round-robln tournament are given. An algorithm of determing △（G） pertect matehings of K2n is proposed. The entire procedure of forming roundrobin tournaments of 8 and 16 players is presented. The Problem concerned about the number of perteet matching disjoint round-robin tournaments is discussed
出处
《数学的实践与认识》
CSCD
北大核心
2006年第12期252-256,共5页
Mathematics in Practice and Theory
关键词
循环赛图
完备匹配
完全图
算法
边矩阵
round-robin tournaments
perfect matching
complete graph
algorithm
edge matrix
