{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:40:44Z","timestamp":1758271244439},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0020-0190(89)90204-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"255-259","source":"Crossref","is-referenced-by-count":6,"title":["Parametric stable marriage and minimum cuts"],"prefix":"10.1016","volume":"30","author":[{"given":"Dan","family":"Gusfield","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert W.","family":"Irving","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90204-4_BIB1","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/321978.321982","article-title":"Mathematical techniques for efficient record segmentation in large shared databases","volume":"23","author":"Eisner","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90204-4_BIB2","unstructured":"G. Gallo, M. Grigoriadis and R.E. Tarjan, A fast parametric network flow algorithm, SIAM J. Comput., to appear."},{"key":"10.1016\/0020-0190(89)90204-4_BIB3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"10.1016\/0020-0190(89)90204-4_BIB4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1145\/2402.322391","article-title":"Parametric combinatorial computing and a problem of program module distribution","volume":"30","author":"Gusfield","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90204-4_BIB5","series-title":"Techn. Report CSE-88-2","article-title":"Parametric stable marriage","author":"Gusfield","year":"1988"},{"key":"10.1016\/0020-0190(89)90204-4_BIB6","unstructured":"D. Gusfield and C. Martel, Fast algorithms for rectilinear layout and other parametric minimum cut problems, in preparation."},{"key":"10.1016\/0020-0190(89)90204-4_BIB7","doi-asserted-by":"crossref","unstructured":"A. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, J. ACM, to appear.","DOI":"10.1145\/12130.12144"},{"key":"10.1016\/0020-0190(89)90204-4_BIB8","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"key":"10.1016\/0020-0190(89)90204-4_BIB9","series-title":"Progress in Combinatorial Optimization","article-title":"Structural theory for the combinatorial systems characterized by submodular functions","author":"Iri","year":"1984"},{"key":"10.1016\/0020-0190(89)90204-4_BIB10","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","article-title":"The complexity of counting stable marriages","volume":"15","author":"Irving","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90204-4_BIB11","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/28869.28871","article-title":"An efficient algorithm for the optimal stable marriage","volume":"34","author":"Irving","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90204-4_BIB12","series-title":"Mariages Stables","author":"Knuth","year":"1976"},{"key":"10.1016\/0020-0190(89)90204-4_BIB13","series-title":"Notes on Introductory Combinatorics","author":"Polya","year":"1983"},{"key":"10.1016\/0020-0190(89)90204-4_BIB14","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TSE.1978.231502","article-title":"Critical load factors in two-processor distributed systems","volume":"3","author":"Stone","year":"1978","journal-title":"IEEE Trans. Software Engng."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:55:49Z","timestamp":1555073749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089902044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0020019089902044"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90204-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}