Help with minimum vertex cover in bipartite graphs

Revision en1, by svg_af, 2016-06-06 14:35:16

Hello there

I know that minimum vertex cover is equal to maximum matching

My question is about how to find the vertices that form the cover

any help would be appreciated

Tags bipartite matching, mvc, konig

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English svg_af 2016-06-06 14:35:16 229 Initial revision (published)