Extended Kuhn-Munkres algorithm for constrained matching search

DOI10.12202/J.0476-0301.2019242MaRDI QIDQ3381017zbMATH OpenOpenAlexFDO

Authors Fangyang Wang, Yuming Liu

Publication date 29 September 2021

Full work available at URL http://www.bnujournal.com/en/article/doi/10.12202/j.0476-0301.2019242

zbMATH Keywords

bipartite graphKuhn-Munkres algorithmoptimal matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 795216
• scientific article; zbMATH DE number 176477
• An efficient algorithm for the bipartite matching problem
• Algorithms for finding k-best perfect matchings
• Faster scaling algorithms for general graph matching problems

Cited in

(3)

• A Further Generalized Kettele Algorithm with Multiple Constraints
• scientific article; zbMATH DE number 176477 (Why is no real title available?)
• scientific article; zbMATH DE number 6917125 (Why is no real title available?)

This page was built for publication: Extended Kuhn-Munkres algorithm for constrained matching search

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