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...

Full description

Bibliographic Details
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