Edmonds' algorithm for weighted matching

E1739864 UNEXPLORED

Edmonds' algorithm for weighted matching is a foundational polynomial-time algorithm in combinatorial optimization that finds maximum-weight matchings in general (non-bipartite) graphs.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Edmonds' algorithm for weighted matching canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Jack Edmonds → knownFor → Edmonds' algorithm for weighted matching ⓘ