Paths, Trees, and Flowers¶
Edmonds, J. (1965). Paths, Trees, and Flowers. Canadian Journal of Mathematics.
Cited by¶
1 citation across 1 artifact.
Domain-specific¶
- Matching
- Edmonds's blossom algorithm (1965) finds maximum matchings in general graphs in polynomial time — \(O(|V|^4)\) in Edmonds's own analysis, sharpened to \(O(|V|^3)\) by Gabow (1976) — a foundational result in combinatorial optimization partly because the algorithm introduced the technique of shrinking odd cycles (blossoms) to handle the non-bipartite case
Supported in partVerified against the source
- Edmonds's blossom algorithm (1965) finds maximum matchings in general graphs in polynomial time — \(O(|V|^4)\) in Edmonds's own analysis, sharpened to \(O(|V|^3)\) by Gabow (1976) — a foundational result in combinatorial optimization partly because the algorithm introduced the technique of shrinking odd cycles (blossoms) to handle the non-bipartite case
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:31a41e810e72 · see in the full table