%0 Journal Article
%T A New Algorithm and Application of Solving Maximum Matching Problem of Bipartite Graph<br>一种求解二部图最大匹配问题新算法及其应用
%A TANG Min
%A GUAN Jiang
%A DENG Guo-Qiang
%A WANG Hai-Gang
%A <br>唐敏
%A 关健
%A 邓国强
%A 王海刚
%J 计算机系统应用
%D 2012
%I 
%X This paper proposed an algorithm for maximum matching of Bipartite graph based on layered network model.Timetable Problems are solved by the new algorithm.A matching rule for layered networks is defined and proposed a concept of layered network first,and a layered network system is generated with the breadth first search strategy.Maximal matching is found according reversed network order.Experiments show that this algorithm can get accurate results and has a good performance with computational complexity in solving large-scale theoretical and practical maximum matching problems of bipartite graph.
%K layered network
%K bipartite graphs
%K maximal matching
%K timetable problems<br>分层网络
%K 二部图
%K 最大匹配
%K 排课问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=57C6AD9B0ADA05377DB16EC9E49FA95C&yid=99E9153A83D4CB11&vid=659D3B06EBF534A7&iid=38B194292C032A66&sid=AA76E167F386B6B3&eid=7E8DE52A3B391A47&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=8