Patrick Posser (Stable Roommates Problem Stable Matching Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
Space Complexity
$O(n)$ words
(https://link.springer.com/chapter/10.1007%2F978-3-319-07046-9_2)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2014
Reference
https://link.springer.com/chapter/10.1007%2F978-3-319-07046-9_2