Rank: 1248 based on 97 downloads (last 30 days) and 1 file submitted
photo

Alexander Melin

E-mail
Company/University
University of Tennessee

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Files Posted by Alexander
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 97 19
  • 4.11765
4.1 | 17 ratings
Comments and Ratings on Alexander's Files View all
Updated File Comment by Comments Rating
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

18 Apr 2013 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Bertelsen, Alvaro

Very good work.

03 Oct 2012 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin yu, sixie

This function can effectively calculate NxN matrices, and can also process NxM matrices. But it is a little difficult to understand the source code. Maybe my abilities matter. In sum, it is useful.

25 Apr 2012 Hungarian Algorithm An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph. Author: Alexander Melin Yi

nice work

Contact us