Revision as of 19:15, 21 September 2006 edit 192.75.48.150 (talk) →Observations: move whole section to talk page ← Previous edit		Revision as of 17:39, 26 September 2006 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits m format Next edit →
Line 46: == Similar problems == The [[weighted matching problem]] is to find a matching in a weighted [[bipartite graph]] that has maximum weight. Maximum weighted matchings do not have to be stable, but in some applications a maximum weighted matching is better than a stable one. ==Further reading==

Stable matching problem: Difference between revisions