Unsworth; C.; Prosser; P (Stable Marriage Problem Stable Matching Problem)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$? words

(Constructs, preprocesses, and solves an $O(n^2)$-size CSP instance? (see original reference))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2005

Reference

http://www.dcs.gla.ac.uk/~pat/roommates/distribution/papers/SM2N.pdf