A recurrent algorithm to solve the weighted matching problem

DOI10.1007/S10559-016-9876-4zbMATH Open1350.05140OpenAlexW2523290243MaRDI QIDQ341372FDOQ341372

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

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

Recommendations

• scientific article; zbMATH DE number 3902700
• Weighted Bipartite Matching in Matrix Multiplication Time
• Optimum matchings in weighted bipartite graphs
• A simple approximation algorithm for the weighted matching problem
• scientific article; zbMATH DE number 1304326

zbMATH Keywords

matchingassignment problembipartite graphaugmenting pathweighted matching problem

Mathematics Subject Classification ID

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

Cites Work

• Matching theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast algorithm to find 2-factor of minimum weight

Cited In (7)

• Research on matrix algorithm of the greatest matching of the simple graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• A recurrent algorithm for solving a combinatorial problem of arrangement with restrictions
• Finding a complete matching with the maximum product on weighted bipartite graphs
• Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
• Solving maximum weighted matching on large graphs with deep reinforcement learning

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

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