In any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover. LP-duality statement for bipartite graphs. Extends to doubly-stochastic matrices via the Birkhoff-von Neumann theorem.
In any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover. LP-duality statement for bipartite graphs. Extends to doubly-stochastic matrices via the Birkhoff-von Neumann theorem.