Hungarian algorithm

Article
Talk

This is an old revision of this page, as edited by Miskin (talk | contribs) at 18:22, 24 December 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hungarian_algorithm&oldid=32612234"