| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428429 | Information Processing Letters | 2007 | 7 Pages |
Abstract
We present two hardness results on the man-exchange stable marriage problem, one of which settles a recent conjecture of Irving on the complexity of determining whether a given instance of the stable marriage problem with short preference lists has a man-exchange stable matching.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
