{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:13:58Z","timestamp":1742973238942,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"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_271","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:34:52Z","timestamp":1214505292000},"page":"606-609","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Stable Marriage"],"prefix":"10.1007","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"271_CR1_271","doi-asserted-by":"crossref","unstructured":"Feder, T.: A\u00a0new fixed point approach for stable networks and stable marriages. In: Proceedings of 21st ACM Symposium on Theory of Computing, pp. 513\u2013522, Theory of Computing, Seattle WA, May 1989, pp. 513\u2013522, ACM, New York (1989)","DOI":"10.1145\/73007.73056"},{"key":"271_CR2_271","unstructured":"Feder, T.: Stable networks and product graphs. Ph.\u202fD. thesis, Stanford University (1991)"},{"key":"271_CR3_271","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T. Feder","year":"1992","unstructured":"Feder, T.: A\u00a0new fixed point approach for stable networks and stable marriages. J.\u00a0Comput. Syst. Sci. 45, 233\u2013284 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"271_CR4_271","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01240738","volume":"11","author":"T. Feder","year":"1994","unstructured":"Feder, T.: Network flow and 2-satisfiability. Algorithmica 11, 291\u2013319 (1994)","journal-title":"Algorithmica"},{"key":"271_CR5_271","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. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"271_CR6_271","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, Cambrigde MA (1989)"},{"issue":"4","key":"271_CR7_271","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/0217048","volume":"17","author":"D. Gusfield","year":"1988","unstructured":"Gusfield, D.: The structure of the stable roommate problem: efficient representation and enumeration of all stable assignments. SIAM J. Comput. 17(4), 742\u2013769 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"271_CR8_271","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":"271_CR9_271","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"},{"issue":"3","key":"271_CR10_271","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R.W. Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal stable\u201d marriage. J.\u00a0ACM 34(3), 532\u2013543 (1987)","journal-title":"J. ACM"},{"issue":"3","key":"271_CR11_271","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. Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"271_CR12_271","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A. Kato","year":"1993","unstructured":"Kato, A.: Complexity of the sex-equal stable marriage problem. Jpn. J. Ind. Appl. Math. 10, 1\u201319 (1993)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"271_CR13_271","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 (1976)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:18Z","timestamp":1738272738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_271"}},"subtitle":["1987; Irving, Leather, Gusfield"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_271","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}