\begin{thebibliography}{10}

\bibitem{Batagelj2005}
Vladimir Batagelj and Ulrik Brandes.
\newblock Efficient generation of large random networks.
\newblock {\em Phys. Rev. E}, 71:036113, Mar 2005.

\bibitem{shuffle}
Richard Durstenfeld.
\newblock Algorithm 235: Random permutation.
\newblock {\em CACM}, 7:420, 1964.

\bibitem{gs62}
D.~Gale and L.S. Shapley.
\newblock {College admissions and the stability of marriage}.
\newblock {\em American Mathematical Monthly}, 69:9--15, 1962.

\bibitem{GS85}
D.~Gale and M.~Sotomayor.
\newblock Some remarks on the stable matching problem.
\newblock {\em Discrete Applied Mathematics}, 11:223--232, 1985.

\bibitem{morph99}
Ian~P. Gent, Holger~H. Hoos, Patrick Prosser, and Toby Walsh.
\newblock Morphing: Combining structure and randomness.
\newblock In {\em Proceedings of the Sixteenth National Conference on
  Artificial Intelligence}, pages 654--660, 1999.

\bibitem{gi89}
D.~Gusfield and R.~W. Irving.
\newblock {\em The Stable Marriage Problem: Structure and Algorithms}.
\newblock The MIT Press, 1989.

\bibitem{Irving85}
Robert~W. Irving.
\newblock {An Efficient Algorithm for the Stable Roommates Problem}.
\newblock {\em J. Algorithms}, 6(4):577--595, 1985.

\bibitem{nature393}
Duncan J.Watts and Steven H.Strogatz.
\newblock Collective dynamics of small-world networks.
\newblock {\em Nature}, 393:440--442, 1998.

\bibitem{manlove2013}
David Manlove.
\newblock {\em Algorithmics of Matching under Preferences}, volume~2 of {\em
  Theoretical Computer Science}.
\newblock World Scientific, 2013.

\bibitem{mertens2005}
Stepan Mertens.
\newblock Random stable matchings.
\newblock {\em {Journal of Statistical Mechanics: Theory and Experiments}},
  (10):P10008, 2005.

\bibitem{mertens2015b}
Stephan Mertens.
\newblock Small random instances of the stable roommates problem.
\newblock {\em Journal of Statistical Mechanics: Theory and Experiment},
  2015(6):P06034, 2015.

\bibitem{mertens2015a}
Stephan Mertens.
\newblock Stable roommates problem with random preferences.
\newblock {\em Journal of Statistical Mechanics: Theory and Experiment},
  2015(1):P01020, 2015.

\bibitem{nh90}
C.~Ng and D.S. Hirschberg.
\newblock Lower bounds for the stable marriage problem and its variants.
\newblock {\em {SIAM} Journal on Computing}, 19:71--77, 1990.

\bibitem{pittel94}
Boris Pittel and Robert~W. Irving.
\newblock An upper bound for the solvability of a random stable roommates
  instance.
\newblock {\em Random Struct. Algorithms}, 5(3):465--487, 1994.

\bibitem{cpaior2014}
Patrick Prosser.
\newblock Stable roommates and constraint programming.
\newblock In {\em Integration of {AI} and {OR} Techniques in Constraint
  Programming - 11th International Conference, {CPAIOR}}, pages 15--28, 2014.

\bibitem{Roth84}
A.E. Roth.
\newblock The evolution of the labor market for medical interns and residents:
  a case study in game theory.
\newblock {\em Journal of Political Economy}, 92(6):991--1016, 1984.

\bibitem{RS90}
A.E. Roth and M.A.O. Sotomayor.
\newblock {\em Two-sided matching: a study in game-theoretic modeling and
  analysis}, volume~18 of {\em Econometric Society Monographs}.
\newblock Cambridge University Press, 1990.

\end{thebibliography}