S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ per processor? words
(Only need to keep track of current (provisional) matchings)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984
Reference
https://link.springer.com/content/pdf/10.1007/BF02136029.pdf