Revision as of 01:15, 4 September 2005 edit Ruud Koot (talk \| contribs) 31,416 edits mNo edit summary		Revision as of 18:22, 24 December 2005 edit undo Miskin (talk \| contribs) Extended confirmed users 8,409 edits No edit summary Next edit →
Line 1: In [[graph theory]], '''Munkres' assignment algorithm''', named after [[James Munkres]], or the '''Hungarian algorithm''' is an [[algorithm]] which solves instances of the [[assignment problem]] in [[polynomial time]]. ~~#REDIRECT [[Munkres' assignment algorithm]]~~

Hungarian algorithm: Difference between revisions