{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:18:30Z","timestamp":1778663910213,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0166-218x(93)90245-j","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:43:22Z","timestamp":1034340202000},"page":"69-74","source":"Crossref","is-referenced-by-count":13,"title":["Generalization of a theorem on the parametric maximum flow problem"],"prefix":"10.1016","volume":"41","author":[{"given":"Tadashi","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"Ueno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoji","family":"Kajitani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90245-J_BIB1","first-page":"9","article-title":"On the parametric flow problem","author":"Arai","year":"1989","journal-title":"IEICE Tech. Rept. CAS-89"},{"key":"10.1016\/0166-218X(93)90245-J_BIB2","series-title":"Ph.D. Thesis","article-title":"The complexity of some problems in parametric linear and combinatorial programming","author":"Carstensen","year":"1983"},{"key":"10.1016\/0166-218X(93)90245-J_BIB3","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\/0166-218X(93)90245-J_BIB4","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(93)90245-J_BIB5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/moor.5.2.186","article-title":"Lexicographically optimal base of a polymatroid with respect to a weight vector","volume":"5","author":"Fujishige","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(93)90245-J_BIB6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90245-J_BIB7","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\/0166-218X(93)90245-J_BIB8","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1002\/net.3230190607","article-title":"A comparison of phase and nonpahse network flow algorithms","volume":"19","author":"Martel","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90245-J_BIB9","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TSE.1978.231502","article-title":"Critical load factors in two-processor distributed systems","volume":"4","author":"Stone","year":"1978","journal-title":"IEEE Trans. Software Engrg."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390245J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390245J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T06:51:16Z","timestamp":1554965476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390245J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["0166218X9390245J"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90245-j","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}