Kuhn's Algorithm , Hungarian Algorithm and other flows

Revision en1, by yaksha, 2018-04-07 10:06:09

Hello all , Lately I am trying to learn more about kuhn's algorithm , But whenever I type "Kuhn's Algorithm" on google the result shows "Hungarian Algorithm"

So I thought both of them are the same ,

After some surfing on topcoder blogs , I found that Kuhn's algorithm works in O(VE) whereas hungarian takes O(V^3) , so are they not same?!

But the way it's given in the topcoder blog , I think that Kuhn's can only be applied on a bipartite graph when all the edge weights are same . .

Is it true , can Kuhn's only be applied when when all the edge weights are same?

Also can someone tell me all the most used flow algorithms / matching algorithms and where to best study them from ? So far I only know the basic Max Flow problem and the Kuhn's algorithm!

Thanks for helping!

Tags help, flows, hungarian algorithm

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English yaksha 2018-04-07 10:16:35 133
en1 English yaksha 2018-04-07 10:06:09 853 Initial revision (published)