{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T20:30:34Z","timestamp":1672518634732},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"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":[[1985,8]]},"DOI":"10.1016\/0020-0190(85)90036-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"75-78","source":"Crossref","is-referenced-by-count":5,"title":["A note on finding minimum cuts in directed planar networks by parallel computations"],"prefix":"10.1016","volume":"21","author":[{"given":"Ladislav","family":"Janiga","sequence":"first","affiliation":[]},{"given":"Vaclav","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90036-5_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1979"},{"key":"10.1016\/0020-0190(85)90036-5_BIB2","article-title":"Parallel algorithms in graph theory: Planarity testing","author":"Ja'Ja'","year":"1980"},{"key":"10.1016\/0020-0190(85)90036-5_BIB3","unstructured":"L. Janiga and V. Koubek, Minimum cut in directed planar networks, To appear."},{"key":"10.1016\/0020-0190(85)90036-5_BIB4","article-title":"Parallel algorithms for minimum cuts and maximum flows in planar networks","volume":"12","author":"Johnson","year":"1982"},{"key":"10.1016\/0020-0190(85)90036-5_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0208012","article-title":"Maximum flow in planar networks","volume":"8","author":"Itai","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(85)90036-5_BIB6","series-title":"Flows in Networks","author":"Ford","year":"1962"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:27:43Z","timestamp":1553578063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["0020019085900365"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90036-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}