Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Hungarian_algorithm
|
| gptkbp:application |
gptkb:machine_learning
computer vision operations research resource allocation job assignment |
| gptkbp:category |
graph algorithms
optimization algorithms |
| gptkbp:complexity |
O(n^3)
|
| gptkbp:field |
combinatorial optimization
graph theory |
| gptkbp:firstPublished |
1955
|
| gptkbp:generalizes |
unweighted bipartite matching
|
| gptkbp:input |
weighted bipartite graph
|
| gptkbp:namedAfter |
gptkb:James_Munkres
gptkb:Harold_Kuhn |
| gptkbp:output |
maximum weight matching
|
| gptkbp:relatedTo |
gptkb:Ford–Fulkerson_algorithm
gptkb:Edmonds'_blossom_algorithm Linear programming |
| gptkbp:solvedBy |
assignment problem
maximum weight matching in bipartite graphs |
| gptkbp:bfsParent |
gptkb:Munkres_assignment_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kuhn–Munkres algorithm
|