{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:43:18Z","timestamp":1750693398918,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_393","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"877-880","source":"Crossref","is-referenced-by-count":2,"title":["Stable Marriage"],"prefix":"10.1007","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"393_CR1_393","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00125-5","volume":"233","author":"T. Feder","year":"2000","unstructured":"Feder, T., Megiddo, N., Plotkin, S.A.: A\u00a0sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1\u20132), 297\u2013308 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"393_CR2_393","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69, 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"393_CR3_393","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discret. Appl. Math. 11, 223\u2013232 (1985)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"393_CR4_393","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"key":"393_CR5_393","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"393_CR6_393","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"R.W. Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the stable roommates problem. J.\u00a0Algorithms 6, 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"393_CR7_393","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R.W. Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48, 261\u2013272 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"393_CR8_393","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R.W. Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J.\u00a0Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"393_CR9_393","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"R.W. Irving","year":"2002","unstructured":"Irving, R.W., Manlove, D.F.: The stable roommates problem with ties. J.\u00a0Algorithms 43, 85\u2013105 (2002)","journal-title":"J. Algorithms"},{"key":"393_CR10_393","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-540-24749-4_20","volume-title":"Proceedings of STACS 2004: the 21st Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2996","author":"T. Kavitha","year":"2004","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Strongly stable matchings in time O(nm), and extension to the H\/R problem. In: Proceedings of STACS 2004: the 21st Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol.\u00a02996, pp.\u00a0222\u2013233. Springer, Berlin (2004)"},{"key":"393_CR11_393","volume-title":"Mariages Stables","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Mariages Stables. Les Presses de L'Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1976)"},{"key":"393_CR12_393","unstructured":"Manlove, D.F.: Stable marriage with ties and unacceptable partners. Technical Report TR-1999-29, University of Glasgow, Department of Computing Science, January (1999)"},{"issue":"1\u20132","key":"393_CR13_393","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"393_CR14_393","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/362619.362631","volume":"14","author":"D. McVitie","year":"1971","unstructured":"McVitie, D., Wilson, L.B.: The stable marriage problem. Commun. ACM 14, 486\u2013490 (1971)","journal-title":"Commun. ACM"},{"key":"393_CR15_393","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1137\/0219004","volume":"19","author":"C. Ng","year":"1990","unstructured":"Ng, C., Hirschberg, D.S.: Lower bounds for the stable marriage problem and its variants. SIAM J.\u00a0Comput. 19, 71\u201377 (1990)","journal-title":"SIAM J. Comput."},{"key":"393_CR16_393","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. J.\u00a0Algorithms 11, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"393_CR17_393","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a\u00a0case study in game theory. J.\u00a0Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"key":"393_CR18_393","unstructured":"Scott, S.: A\u00a0study of stable marriage problems with ties. Ph.\u202fD. thesis, University of Glasgow, Department of Computing Science (2005)"},{"key":"393_CR19_393","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/BF01932966","volume":"12","author":"L.B. Wilson","year":"1972","unstructured":"Wilson, L.B.: An analysis of the stable marriage assignment algorithm. BIT 12, 569\u2013575 (1972)","journal-title":"BIT"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:33:59Z","timestamp":1662176039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_393"}},"subtitle":["1962; Gale, Shapley"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_393","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}