Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:blossom_algorithm
|
| gptkbp:appliesTo |
general graphs
|
| gptkbp:complexity |
O(n^3)
|
| gptkbp:field |
combinatorial optimization
graph theory |
| gptkbp:foundIn |
maximum matching
|
| gptkbp:generalizes |
gptkb:Hungarian_algorithm
|
| gptkbp:handles |
odd-length cycles
|
| https://www.w3.org/2000/01/rdf-schema#label |
Edmonds' blossom algorithm
|
| gptkbp:implementedIn |
gptkb:NetworkX
gptkb:Boost_Graph_Library gptkb:LEMON_graph_library |
| gptkbp:introduced |
gptkb:Jack_Edmonds
|
| gptkbp:introducedIn |
1965
|
| gptkbp:isFoundationalFor |
matching theory
|
| gptkbp:isPolynomialTime |
true
|
| gptkbp:solvedBy |
maximum matching problem
|
| gptkbp:usedFor |
matching in non-bipartite graphs
|
| gptkbp:uses |
shrinking blossoms
|
| gptkbp:bfsParent |
gptkb:Paths,_Trees,_and_Flowers_(1965)
|
| gptkbp:bfsLayer |
6
|