Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01965367n
Noun Concept
Categories: Matching, Combinatorial optimization
EN
Hungarian algorithm  Hungarian method  KM algorithm  Kuhn's algorithm  Kuhn-Munkres algorithm
EN
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. Wikipedia
Definitions
Relations
Sources
EN
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later primal–dual methods. Wikipedia
A polynomial time algorithm for solving the assignment problem Wikipedia Disambiguation
Combinatorial optimization algorithm for the assignment problem Wikidata
IS A
algorithm
DISCOVERER OR INVENTOR
Harold W. Kuhn
Wikipedia
EN
Hungarian algorithm
Wikidata
EN
Hungarian algorithm
Wikipedia Redirections
EN
Hungarian method, KM algorithm, Kuhn's algorithm, Kuhn-Munkres algorithm, Munkres' assignment algorithm
Wikidata Alias
EN
Kuhn–Munkres algorithm, Munkres assignment algorithm

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License