{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:31:54Z","timestamp":1778592714935,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["III44006"],"award-info":[{"award-number":["III44006"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s42979-020-00124-z","type":"journal-article","created":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T15:04:01Z","timestamp":1586271841000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Note on the Stable Marriage Problem"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2400-6020","authenticated-orcid":false,"given":"Dejan","family":"Zivkovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,7]]},"reference":[{"key":"124_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS. College admissions and the stability of marriage. Am Math Mon. 1962;69:9\u201315.","journal-title":"Am Math Mon"},{"key":"124_CR2","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of matching under preferences","author":"D Manlove","year":"2013","unstructured":"Manlove D. Algorithmics of matching under preferences. Singapore: World Scientific; 2013."},{"key":"124_CR3","volume-title":"Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth DE. Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms. Philadelphia: American Mathematical Society; 1997."},{"key":"124_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"18","author":"D Gusfield","year":"1987","unstructured":"Gusfield D. Three fast algorithms for four problems in stable marriage. SIAM J Comput. 1987;18:111\u201328.","journal-title":"SIAM J Comput"},{"key":"124_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3390\/a6040591","volume":"6","author":"M Gelain","year":"2013","unstructured":"Gelain M, Pini MS, Rossi F, Venable KB, Walsh T. Local search approaches in stable matching problems. Algorithms. 2013;6:591\u2013617.","journal-title":"Algorithms"},{"key":"124_CR6","doi-asserted-by":"crossref","unstructured":"Manne F, Naim M, Lerring H, Halappanavar M. On stable marriages and greedy matchings. In: Proceedings of the seventh SIAM workshop on combinatorial scientific computing, Albuquerque, New Mexico; 2016. p. 92\u2013101.","DOI":"10.1137\/1.9781611974690.ch10"},{"issue":"7","key":"124_CR7","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/362619.362631","volume":"14","author":"DG McVitie","year":"1971","unstructured":"McVitie DG, Wilson LB. The stable marriage problem. Commun ACM. 1971;14(7):486\u201390.","journal-title":"Commun ACM"},{"key":"124_CR8","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BF02136029","volume":"24","author":"SS Tseng","year":"1984","unstructured":"Tseng SS, Lee RCT. A parallel algorithm to solve the stable marriage problem. BIT. 1984;24:308\u201316.","journal-title":"BIT"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00124-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-020-00124-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00124-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T23:21:44Z","timestamp":1617751304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-020-00124-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00124-z","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"2 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"115"}}