Help with minimum vertex cover in bipartite graphs

Правка en1, от 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

Теги bipartite matching, mvc, konig

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский svg_af 2016-06-06 14:35:16 229 Initial revision (published)