Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Hungarian_algorithm
|
| gptkbp:category |
graph algorithms
optimization algorithms |
| gptkbp:complexity |
O(n^3)
|
| gptkbp:field |
combinatorial optimization
|
| gptkbp:firstPublished |
1955
|
| gptkbp:generalizes |
Jonker-Volgenant algorithm
|
| gptkbp:improves |
gptkb:Edmonds'_blossom_algorithm
|
| gptkbp:input |
weighted bipartite graph
|
| gptkbp:namedAfter |
gptkb:James_Munkres
gptkb:Harold_Kuhn |
| gptkbp:output |
maximum weight matching
|
| gptkbp:relatedTo |
linear programming
network flow |
| gptkbp:solvedBy |
assignment problem
maximum weight matching in bipartite graphs |
| gptkbp:usedIn |
computer science
economics operations research |
| gptkbp:bfsParent |
gptkb:Hungarian_algorithm
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kuhn-Munkres algorithm
|