| 一种依据慈善算法的偶图k-完全匹配 |
| |
| 引用本文： | 李毅超,陈波,周明天. 一种依据慈善算法的偶图k-完全匹配[J]. 电子科技大学学报(社会科学版), 2004, 0(5) |
| |
| 作者姓名： | 李毅超 陈波 周明天 |
| |
| 作者单位： | 电子科技大学计算机科学与工程学院 成都610054(李毅超，陈波)，电子科技大学计算机科学与工程学院 成都610054(周明天) |
| |
| 摘 要： | 在扩展一种基于内容的负载共享算法的过程中,总结了将初始化负载分布到集群成员服务器的模型和方法,探讨了依据慈善算法进行偶图一对多匹配即k-完全匹配的问题。给出了一些应用慈善算法进行偶图匹配的重要实验结果,并对慈善算法存在的问题和在超图等研究领域的潜在应用进行了讨论。
|
| 关 键 词： | 偶图 一对多匹配 k-完全匹配 慈善算法 |
A Kind of Charity Algorithm for k-Perfect Matching of Bipartite Graph |
| |
| Li Yichao,Chen Bo,Zhou Mingtian. A Kind of Charity Algorithm for k-Perfect Matching of Bipartite Graph[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 2004, 0(5) |
| |
| Authors: | Li Yichao Chen Bo Zhou Mingtian |
| |
| Abstract: | The present paper summarizes the one-to-many matching model of bipartite model and corresponding methodology formalized in the process of extending a content-based load sharing algorithm, LARD. Such a one-to-many matching is referred to as k-perfect matching, and a charity algorithm is given as the solution. Some experimental results for the matching based on charity algorithm are then presented, with open issues and potential applicability in the context of hyper graph left as discussions. |
| |
| Keywords: | bipartite-graph one-to-many matching k-perfect matching charity algorithm |
| 本文献已被 CNKI 等数据库收录！ |
