Construct · 1 fields · 1 citations

blossom algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
blossomalgorithm1 CONSTRUCTBlossom algorithmEDMONDS · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a polynomial-time method for maximum matching in general graphs that contracts odd cycles, called blossoms, while searching for augmenting paths.

In algorithms and data structures, blossom algorithm refers to a polynomial-time method for maximum matching in general graphs that contracts odd cycles, called blossoms, while searching for augmenting paths. This meaning comes from Edmonds (1965) in Canadian Journal of Mathematics.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how blossom algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

matching4 fields · 4 citationsjingle · one word, four constructs

References

  1. Edmonds, J. (1965). Paths, Trees, and Flowers. Canadian Journal of Mathematics, 17, 449-467. https://doi.org/10.4153/cjm-1965-045-4

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct