湖南大学学报（自然科学版）2011，Vol.38Issue(12)：72-76,5.
Kv的完备匹配Mi的算法
Algorithms of Determining Any Perfect Matching Mi of Kv
摘要
Abstract
A dehnition ot edge-matnx was given. And two algorithms tor determining perfect matching iw, were proposed, of which the algorithm A is determined by using A(G)-edge coloring of edge-matrix K2n, and the algorithm B to perfectly match Mt is determined by partitioning edge-matrix Kv into 2×2 sub matrix and also by solving n- 1 perfect matching Mi of a complete graph Kn. The procedures of constructing round-robin tournament K20ω by using the algorithm A and using algorithm B were presented respectively.关键词
完备匹配/完全图/算法/边矩阵/边着色Key words
dual/perfect matching/complete graph/algorithm/edge matrix/edge coloring分类
数理科学引用本文复制引用
郑长波,李晓毅,侴万禧..Kv的完备匹配Mi的算法[J].湖南大学学报（自然科学版）,2011,38(12):72-76,5.基金项目
辽宁省高等学校科学研究项目(20060842) （20060842）
