Talk:Stable roommates problem
|WikiProject Computer science||(Rated Start-class)|
Someone should add the runtime complexity of the algorithm to find matches so I know if it's worth looking up the paper.
Error in the example
The text explains how in Phase 2, a chain of odd length means that there is no stable pairing. On the other hand, the example ends with a stable pairing after some rotations, one of them of length 3. It's easy to check that that chain is not correct. — Preceding unsigned comment added by Davidsevilla (talk • contribs) 15:10, 29 June 2011 (UTC)
What is O(n^2)? It is written like it's common knowledge, however I'm pretty certain it's not. IMO encyclopædia should not assume previous knowledge. At least there should be a link an explanatory page. --Kebman (talk) 20:39, 6 January 2013 (UTC)