多部图的最大匹配算法  

An Algorithm on Maximum Matching of Multipartite Graph

作　　者：毛华[1] 赵小娜[1] 史田敏[1] 毛晓亮[1] 刘辉[1] 

机构地区：[1]河北大学数学与计算机学院,河北保定071002

出　　处：《郑州大学学报（理学版）》2013年第1期27-29,37,共4页Journal of Zhengzhou University:Natural Science Edition

基　　金：保定市科学技术研究项目;编号11ZG005

摘　　要：匹配理论是图论中一个重要的分支,已被广泛地应用于许多领域,如组合优化、线性规划、人工智能和矩阵论等.给出一个求解多部图的最大匹配算法,并用仿真例子说明其实用性和有效性,此算法为解决复杂的指派问题开辟了新途径.As an important branch in graph theory,matching theory was applied in many fields such as combinatorial optimization,linear programming,artificial intelligence theoretical and matrix theory.An algorithm was provided relative to solving with the maximum matching of multipartite graph.The practicability and effectiveness of this algorithm was illustrated by a simulation example.This algorithm explored a new way dealing with complex allocation problems.

关 键 词：匹配理论 最大匹配 多部图 

分 类 号：O23[理学—运筹学与控制论]