2012•Journal of Sichuan Normal UniversityRequires access

Research on Matrix Algorithm of the Greatest Matching of the Simple Graph

Zhuang Liu

Abstract

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.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Matching (statistics), 3-dimensional matching, Optimal matching, Simple (philosophy), Blossom algorithm, Mathematics, Algorithm, Factor-critical graph