minimum_vertex_cover_bipartite (273B)
1 # Minimum vertex cover bipartite 2 3 finding [minimum_vertex_cover] in [graph_bipartite] 4 5 Algorithm: We use [koenigs_theorem] to say it is equivalent to finding a [maximum_matching] 6 7 See also: [maximum_independent_set_bipartite] 8 9 Up: [minimum_vertex_cover], [graph_bipartite]