Research on matrix algorithm of the greatest matching of the simple graph

DOI10.3969/J.ISSN.1001-8395.2012.04.010MaRDI QIDQ4927022zbMATH OpenFDO

Authors Chunsheng Duan, Liu Zhuang

Publication date 20 June 2013

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-8395.2012.04.010

zbMATH Keywords

correlation matrixform-operating methodmatching priority indexmaximum matchingsimple graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• An algebraic matching algorithm
• scientific article; zbMATH DE number 177842
• scientific article; zbMATH DE number 4101258
• Efficient algorithms for finding maximum matching in graphs
• A recurrent algorithm to solve the weighted matching problem

Cited in

(4)

• An algebraic matching algorithm
• Maximum matchings of a digraph based on the largest geometric multiplicity
• Matching index and its algorithm of uncertain random graph
• The maximum fuzzy weighted matching models and hybrid genetic algorithm

This page was built for publication: Research on matrix algorithm of the greatest matching of the simple graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4927022)