Jump to content

Munkres' assignment algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Miskin (talk | contribs) at 16:46, 24 December 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.


References

  • Illustration and explanation
  • Public Domain This article incorporates public domain material from Paul E. Black. "Munkres' assignment algorithm". Dictionary of Algorithms and Data Structures. NIST.


Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Munkres%27_assignment_algorithm&oldid=32604839"