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
Comment only
07 Mar 2014
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
Comment only