S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem)

From Algorithm Wiki
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=S._S._TSENG_and_R._C._T._LEE_(Stable_Marriage_Problem_Stable_Matching_Problem)&oldid=45436"