Abstract
We discuss 1-2 matchings, which are matchings in bipartite graphs G = (S S′, E) where their elements are pairs of edges with common endpoints in S. An algorithm to find an optimal 1-2 matching is derived. We also discuss 1-2 matchings of the different kind, which are special kinds of 1-2 matchings. The maximum 1-2 matching problem of the different kind can be analyzed by using augmenting trails of the different kind that are analogues of augmenting paths in the usual matching problem. The optimal 1-2 matching problem of the different kind can be reduced to the minimum-cost flow problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
