原书出处
Introduction to Algorithms, Fourth Edition
25 第25章 二分图匹配
Davis to Oscar, and Davis prefers Karen to Emma. Therefore, this matching is not stable.
Stable matchings need not be unique. For example, suppose that there are three women—Monica, Phoebe, and Rachel—and three men—Chandler, Joey, and Ross—with these preferences: Monica: Chandler, Joey, Ross Phoebe: Joey,
Ross, Chandler Rachel: Ross, Chandler, Joey Chandler: Phoebe, Rachel, Monica Joey: Rachel
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter025.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea