Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Edmonds'_algorithm
|
| gptkbp:appliesTo |
undirected graphs
|
| gptkbp:category |
combinatorial optimization
|
| gptkbp:complexity |
O(n^3)
|
| gptkbp:field |
graph theory
|
| gptkbp:foundIn |
maximum cardinality matching
maximum weight matching |
| gptkbp:generalizes |
gptkb:Hungarian_algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
blossom algorithm
|
| gptkbp:introducedIn |
1965
|
| gptkbp:inventedBy |
gptkb:Jack_Edmonds
|
| gptkbp:notableFor |
handling odd-length cycles (blossoms)
|
| gptkbp:publishedIn |
gptkb:Canadian_Journal_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:Edmonds'_matching_polytope
matching theory |
| gptkbp:solvedBy |
maximum matching in general graphs
|
| gptkbp:usedIn |
gptkb:network_protocol
computer science operations research |
| gptkbp:bfsParent |
gptkb:Jack_Edmonds
|
| gptkbp:bfsLayer |
5
|