pratikmoona's blog

By pratikmoona, 12 years ago, In English

I recently learnt about Konig's theorem which states that finding the vertex cover in a bipartite graph is equivalent to finding the maximal matching.


It's simple to edit the hungarian algorithm or any other matching algorithm if it is an unweighted graph. But how do I do the same when it is a "Vertex-Weighted" graph?
  • Vote: I like it
  • +17
  • Vote: I do not like it

»
6 months ago, # |
  Vote: I like it +1 Vote: I do not like it

I'm wondering too. Any ideas?