Abstract
One of the central problems of discrete optimization is the problem of determining the maximal matching, which can be solved in various ways, depending on the structure of the initial data. In this article, a comparative study of the efficiency of maximal flow algorithms (Ford-Fulkerson) and the direct algorithm for determining maximal matching (Even & Kariv) on unweighted bipartite graphs is conducted. The analysis is based on a set of high-difficulty computing competition problems. Therefore, the results will be useful not only to those interested in the maximal matching problem but also to all those who are preparing to participate in various programming competitions.
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 callDisclaimer: 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.
