Revision as of 09:13, 3 February 2005 edit Nichtich~enwiki (talk \| contribs) 330 edits Similar problems: weighted matching problem ← Previous edit		Revision as of 08:44, 5 February 2005 edit undo Zarvok (talk \| contribs) 364 edits m →Similar problems: linkage Next edit →
Line 28: == 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. ~~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.~~ ==Other observations==

Stable matching problem: Difference between revisions