Algorithms for Super Stable Matching and Strongly Stable Matching
碩士 === 國立交通大學 === 資訊科學學系 === 84 === An instaance of the classical stable marriage problem is that of matching n mem and n women, each of whom has ranked the members of the opposite sex in strict order of preference, so that no unmatched...
Main Authors: | Lin, I-Ming, 林義明 |
---|---|
Other Authors: | Jimmy J. M. Tan |
Format: | Others |
Language: | zh-TW |
Published: |
1996
|
Online Access: | http://ndltd.ncl.edu.tw/handle/15909480852057729966 |
Similar Items
-
On Stable Matchings and Flows
by: Tamás Fleiner
Published: (2014-01-01) -
Properties of Stable Matchings
by: Szestopalow, Michael Jay
Published: (2010) -
Properties of Stable Matchings
by: Szestopalow, Michael Jay
Published: (2010) -
A study of stable matching
by: GUO, RUI-TING, et al.
Published: (1990) -
Maximum Locally Stable Matchings
by: Eric McDermid, et al.
Published: (2013-06-01)