Irving's Algorithm (Stable Roommates Problem Stable Matching Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$? words
(Manipulates the $O(n)$-many $O(n)$-size preference lists)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1985
Reference
http://www.dcs.gla.ac.uk/~pat/jchoco/roommates/papers/Comp_sdarticle.pdf