Rank: 794 based on 165 downloads (last 30 days) and 1 file submitted
photo

Alexander Melin

E-mail
Company/University
University of Tennessee

Personal Profile:

 

Watch this Author's files

 

Files Posted by Alexander Melin
Updated   File Tags Downloads
(last 30 days)
Comments Rating
08 Aug 2006 Screenshot Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin optimization, minimum, maximum, weight, matching 165 21
  • 4.0
4.0 | 19 ratings
Comments and Ratings on Alexander Melin's Files View all
Updated File Comment by Comments Rating
29 Nov 2014 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Quoc Viet Pham

Great work. Thousands of thanks for you.

03 Nov 2014 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Snow Lay

31 Oct 2014 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Matteo

Hi people,
I a question about the hungarian algorithm. this algorithm is optimal algorithm for the assignment problem, and the time complexity is O(n^3), right?
But , if the input is the multidimensional matrix, it's possible to use the hungarian algorithm? how does it change the algorithm and the time complexity ?
thanks

07 Mar 2014 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Shawn Lu

04 May 2013 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Mojeeb

nice

Contact us