A New Algorithm and Application of Solving Maximum Matching Problem of Bipartite Graph
一种求解二部图最大匹配问题新算法及其应用

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.