{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:32:04Z","timestamp":1649190724968},"reference-count":21,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0167-8191(03)00022-x","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T03:51:24Z","timestamp":1047700284000},"page":"767-794","source":"Crossref","is-referenced-by-count":7,"title":["The maximum flow problem: a real-time approach"],"prefix":"10.1016","volume":"29","author":[{"given":"Naya","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00022-X_BIB1","unstructured":"S.G. Akl, Nonlinearity, maximization and parallel real-time computation, in: Proceedings of the 12th Conference on Parallel and Distributed Computing and Systems, Las Vegas, NV, November 2000, pp. 31\u201336"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB2","doi-asserted-by":"crossref","unstructured":"S.G. Akl, Parallel real-time computation: sometimes quantity means quality, in: Proceedings of the International Symposium on Parallel Architectures, Dallas, TX, December 2000, pp. 2\u201311","DOI":"10.1109\/ISPAN.2000.900252"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB3","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1142\/S0129626499000463","article-title":"Parallel real-time optimization: beyond speedup","volume":"9","author":"Akl","year":"1999","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB4","unstructured":"S.D. Bruda, S.G. Akl, On the data-accumulating paradigm, in: Proceedings of the Fourth International Conference on Computer Science and Informatics, Research Triangle Park, NC, October 1998, pp. 150\u2013153"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB5","unstructured":"S.D. Bruda, S.G. Akl, Real-time computation: a formal definition and its applications, Technical Report no. 2000-435, Department of Computing and Information Science, Queen\u2019s University, Kingston, Ont., 2000"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB6","series-title":"Proceedings of the Calgary International Conference on Combinatorial Structures and their Applications","first-page":"93","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"10.1016\/S0167-8191(03)00022-X_BIB8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","article-title":"Scaling algorithms for network problems","volume":"31","author":"Gabow","year":"1985","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0022-0000(80)90035-5","article-title":"An O(EVlog2V) algorithm for the maximum flow problem","volume":"21","author":"Galil","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB10","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg, Recent developments in maximum flow algorithms, Technical Report no. 98-045, NEC Research Institute, Inc., April 1998","DOI":"10.1007\/BFb0054350"},{"issue":"5","key":"10.1016\/S0167-8191(03)00022-X_BIB11","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1145\/290179.290181","article-title":"Beyond the flow decomposition barrier","volume":"45","author":"Goldberg","year":"1998","journal-title":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S0167-8191(03)00022-X_BIB12","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum-flow-problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(89)90084-7","article-title":"A parallel algorithm for finding a blocking flow in an acyclic network","volume":"31","author":"Goldberg","year":"1989","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB14","unstructured":"A.V. Karzanov, Determining the maximal flow in a network by the method of preflows, DOKLADY: Russian Academy of Sciences Doklady, Mathematics (formerly Soviet Mathematics-Doklady), 15, 1974"},{"issue":"3","key":"10.1016\/S0167-8191(03)00022-X_BIB15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jagm.1994.1044","article-title":"A faster deterministic maximum flow algorithm","volume":"17","author":"King","year":"1994","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB16","unstructured":"M. Nagy, S.G. Akl, Real-time minimum vertex cover for two-terminal series-parallel graphs, Technical Report no. 2000-441, Department of Computing and Information Science, Queen\u2019s University, Kingston, Ont., 2000, 18 pp"},{"issue":"2","key":"10.1016\/S0167-8191(03)00022-X_BIB17","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0196-6774(82)90013-X","article-title":"An O(n2logn) parallel MAX-FLOW algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"Journal of Algorithms"},{"issue":"1","key":"10.1016\/S0167-8191(03)00022-X_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"3","author":"Stone","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"10.1016\/S0167-8191(03)00022-X_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jpdc.1997.1385","article-title":"Constant time graph algorithms on the reconfigurable multiple bus machine","volume":"46","author":"Trahan","year":"1997","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"10.1016\/S0167-8191(03)00022-X_BIB20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1006\/jpdc.1996.0047","article-title":"On the power of segmenting and fusing buses","volume":"34","author":"Trahan","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(03)00022-X_BIB21","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0196-6774(92)90051-D","article-title":"A parallel blocking flow algorithm for acyclic networks","volume":"13","author":"Vishkin","year":"1992","journal-title":"Journal of Algorithms"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910300022X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910300022X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T23:30:11Z","timestamp":1553470211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781910300022X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S016781910300022X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00022-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}