A recurrent algorithm to solve the weighted matching problem

DOI10.1007/S10559-016-9876-4zbMath1350.05140OpenAlexW2523290243MaRDI QIDQ341372

O. B. Matsiy, A. V. Panishev, A. V. Morozov

Publication date: 16 November 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9876-4

zbMATH Keywords

bipartite graphmatchingassignment problemaugmenting pathweighted matching problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast algorithm to find 2-factor of minimum weight
• Matching theory

This page was built for publication: A recurrent algorithm to solve the weighted matching problem