Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Kuhn-Munkres_algorithm
|
| gptkbp:appliesTo |
bipartite graphs
|
| gptkbp:basedOn |
earlier work by Dénes Kőnig
earlier work by Jenő Egerváry |
| gptkbp:category |
graph algorithms
optimization algorithms |
| gptkbp:complexity |
O(n^3)
|
| gptkbp:field |
combinatorial optimization
operations research |
| gptkbp:generalizes |
gptkb:Munkres_assignment_algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hungarian algorithm
|
| gptkbp:input |
cost matrix
|
| gptkbp:introduced |
gptkb:Harold_Kuhn
|
| gptkbp:introducedIn |
1955
|
| gptkbp:namedAfter |
Hungarian mathematicians
|
| gptkbp:output |
optimal assignment
|
| gptkbp:solvedBy |
assignment problem
|
| gptkbp:usedIn |
resource allocation
job assignment matching problems |
| gptkbp:bfsParent |
gptkb:Munkres_assignment_algorithm
gptkb:blossom_algorithm |
| gptkbp:bfsLayer |
6
|