Algorithm for Matching Problems of Multi-partite Graphs Which Include One Cycle
Jiao An-quan · Journal of Guangxi Normal University · 2007
The paper defines multi-partite graphs and matching problems for it,and defines the multi-partite graphs which including only one cycle,and discusses a method that to solve maximum matching problem of the multi-partite graphs which including only one cycle,suggest a algorithm that based on reachable of multi-partite graphs,and utilize one of the maximum matching problems algorithm of bipartite graph to find a maximum matching of the multi-partite graph which including only one cycle.