|
|
back to boardHow to solve it? Give me some hint plz. Re: How to solve it? Posted by svr 22 Oct 2011 10:48 I red in some book, Konig: for bipartite graph (V,E) and any weight function w:E->Z+ maximal weight w(M) of matching is eqal minimal Sum of y(i) where y:V->Z+ some weightes of nodes such that y(i)+y(j)>=w(e(i,j)). So, 1) Make bipartite graph 2)find maximal weight matching using hungarian method |
|
|