Research on Matrix Algorithm of the Greatest Matching of the Simple Graph
Zhuang Liu · Journal of Sichuan Normal University · 2012
In this paper,for a simple graph the concepts of matching priority index of a matching edge,competitive set,matching coset and matching co-graph,etc,are defined.By using the definition of maximum matching and the competitive relation between matching and non-matching edges,based on the correlative matrix of a graph,a new algorithm named form-operating is creatively proposed for non-weighted simple graphs.In using this method to calculate the maximum matching,the operation is simple and the programming is quite easy.