Jump to content

Munkres' assignment algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ruud Koot (talk | contribs) at 01:18, 4 September 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 or the Hungarian algorithm is an algorithm which solves the assignment problem in polynomial time.

References

  • Public Domain This article incorporates public domain material from Paul E. Black. "Munkres' assignment algorithm". Dictionary of Algorithms and Data Structures. NIST.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Munkres%27_assignment_algorithm&oldid=22512184"