An Algorithm for the Matching Problems of the Multi-partite Graphs
Baihai Zhang · Computer Engineering and Science · 2009
This paper defines the quotient matching problems of multi-partite graphs,and puts forward an algorithm that solves the maximum quotient matching problem of the multi-partite graphs.This algorithm uses the bipartite graph joining in circle and cut of multi-partite graphs,and utilizes one of the maximum matching problem algorithm of bipartite graphs to find a maximum quotient matching of multi-partite graphs.