{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:16:52Z","timestamp":1648999012426},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90010-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"409-429","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling transmissions in a network"],"prefix":"10.1016","volume":"6","author":[{"given":"Alon","family":"Itai","sequence":"first","affiliation":[]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90010-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(85)90010-0_BIB2","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"2","author":"Dinic","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(85)90010-0_BIB3","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0196-6774(85)90010-0_BIB4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithm efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach"},{"key":"10.1016\/0196-6774(85)90010-0_BIB5","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0196-6774(85)90010-0_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0022-0000(80)90035-5","article-title":"An O(EV log2V) algorithm for the maximal flow problem","volume":"21","author":"Galil","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90010-0_BIB7","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(85)90010-0_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(78)90016-9","article-title":"An O(|V|3) algorithm for finding maximum flow in networks","volume":"7","author":"Malhotra","year":"1978","journal-title":"Inform Process. Lett."},{"key":"10.1016\/0196-6774(85)90010-0_BIB9_1","unstructured":"D. D. Sleator and E. T. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. in press"},{"key":"10.1016\/0196-6774(85)90010-0_BIB9_2","series-title":"13th ACM Symops. Theory of Computing","first-page":"114","author":"Sleator","year":"1981"},{"key":"10.1016\/0196-6774(85)90010-0_BIB10","article-title":"An O(n \u00b7 I log2I) maximum-flow algorithm","author":"Shiloach","year":"1978"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:02Z","timestamp":1548743162000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900100"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90010-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}