Hungarian algorithm: Difference between revisions

Revision as of 18:33, 24 December 2005

Revision as of 19:07, 24 December 2005

Line 1:

In [[graph theory]], the '''Hungarian algorithm''' is an [[algorithm]] on [[Combinatorial Optimization]], which solves instances of the [[assignment problem]] in [[polynomial time]]. Its first version, known as the '''Hungarian method''', was invented and published by H.[[Harold Kuhn]] in 1955. The Hungarian method was in turn revised by [[James Munkres]] in 1957, and ever since it has been widely known as the '''Hungarian algorithm''', or the '''Munkres' assignment algorithm''', or even as the '''Kuhn-Munkres algorithm'''.

[[Category:Algorithms]]