{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:49:29Z","timestamp":1648928969163},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00485-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"155-159","source":"Crossref","is-referenced-by-count":0,"title":["An efficient minimum and maximum global snapshot algorithm"],"prefix":"10.1016","volume":"86","author":[{"given":"L.-B.","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00485-4_BIB001","series-title":"9th International Workshop on Distributed Algorithms","first-page":"303","article-title":"Efficient detection of restricted classes of global predicates","author":"Chase","year":"1995"},{"key":"10.1016\/S0020-0190(02)00485-4_BIB002","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0020-0190(98)00100-8","article-title":"On the time complexity of minimum and maximum global snapshot problems","volume":"67","author":"Chen","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00485-4_BIB003","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":"Can. J. Math."},{"key":"10.1016\/S0020-0190(02)00485-4_BIB004","unstructured":"A.V. Goldberg, Recent developments in maximum flow problems, Technical report 98-045, NEC Research Institute, Inc., 1998"},{"issue":"4","key":"10.1016\/S0020-0190(02)00485-4_BIB005","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":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00485-4_BIB006","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/88.260297","article-title":"Bounded and minimum global snapshots","author":"Groselj","year":"1993","journal-title":"IEEE Parallel Distrib. Technology"},{"issue":"4","key":"10.1016\/S0020-0190(02)00485-4_BIB007","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1093\/comjnl\/41.4.231","article-title":"On detection of bounded global predicates","volume":"41","author":"Wu","year":"1998","journal-title":"Comput. J."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:29:35Z","timestamp":1553448575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002004854"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00485-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}