Abstract
It is a celebrated result in early combinatorics that, in bipartite graphs, the size of maximum matching is equal to the size of a minimum vertex cover. Kőnig's proof of this fact gave an algorithm for finding a minimum vertex cover from a maximum matching. In this paper, we revisit the connection this algorithm induces between the two types of structures. We find that all minimum vertex covers can be found by applying this algorithm to some matching and then classify which matchings give minimum vertex covers when this algorithm is applied to them.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.